trans/graphhopper-jsprit
1
0
Fork 0
mirror of https://github.com/graphhopper/jsprit.git synced 2020-01-24 07:45:05 +01:00
Code Issues Releases Wiki Activity
No description
471 commits 15 branches 24 tags 19 MiB
Find a file
Stefan Schroeder 149c4d4ecb make reader/writer read and write penalty-flags indicating whether a 
vehicle/vehicle-type is a penalty-vehicle/type
2013-12-04 15:08:13 +01:00
jsprit-analysis add zoom to plotter, i.e. add plotter.setBoundaryBox(...) 2013-11-29 16:59:44 +01:00
jsprit-core make reader/writer read and write penalty-flags indicating whether a 2013-12-04 15:08:13 +01:00
jsprit-examples play with bicycle-messenger example 2013-12-04 07:41:16 +01:00
jsprit-instances remove license txt from pom-files 2013-11-26 11:08:25 +01:00
.gitignore rm .DS_Store files and add them to .gitignore 2013-06-06 11:00:07 +02:00
.project clean 2013-06-04 14:43:49 +02:00
CHANGELOG.md update according to v1.0.0 2013-11-26 15:04:08 +01:00
license.txt add license.txt prj-head and license-head to latest example 2013-11-26 17:15:57 +01:00
pom.xml remove license txt from pom-files 2013-11-26 11:08:25 +01:00
README.md Update README.md 2013-11-27 09:54:58 +01:00

README.md

jsprit

jsprit is a java based, open source toolkit for solving a set of well-known traveling salesman (TSP) and vehicle routing problems (VRP). It is lightweight and easy-to-use, and based on heuristics currently solving

  • Capacitated VRP
  • Multiple Depot VRP
  • VRP with Time Windows
  • VRP with Backhauls
  • VRP with Pickups and Deliveries
  • VRP with Heterogeneous Fleet
  • Time-dependent VRP
  • Traveling Salesman Problem
  • Dial-a-Ride Problem
  • Various combination of these types

Setting up the problem, modifying the algorithms and visualising the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm.

Additionally, jsprit can be used along with MATSim to solve the above problem-types in real networks (i.e. without preprocessing transport times and costs). A variety of least cost path algorithms such as Dijkstra and A* can be used, and a dynamic and interactive visualiser greatly enhances the analysis.

##In Development

  • continues improvement of code, handling and performance
  • soft constraints
  • various capacity dimensions and multiple time-windows
  • open routes (currently they have to return to the depot)
  • large scale instances

##Documentation

Please visit jsprit-wiki to learn more.

##License This software is released under LGPL.

##Getting started in 2 seconds

Add the latest snapshot to your pom.

Add the latest release to your pom.

##About The jsprit-project is created and maintained by Stefan Schröder. It is motivated by two issues.

First, there is an almost endless list of papers and algorithms to tackle vehicle routing problems, BUT there are (as far as I know) only a very few open source implementations of one of these thousands algorithms.

Second, it is motivated by my PhD-project at KIT where I apply vehicle routing algorithms to solve behavioural models of freight agents to assess (freight) transport policy measures.

It is mainly inspired by my research group at KIT-ECON, and by an awesome open-source project called MATSim and its developers.

If you have questions or if you use jsprit, it would be great you give feedback and let me know your experience:

Email: jsprit.vehicle.routing@gmail.com