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

Update README.md

Browse source
This commit is contained in:
jsprit 2013-06-18 06:48:50 +03:00
parent 0cc9c47a92
commit 83a02a37e6
1 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
README.md
View file

@ -1,14 +1,14 @@
jsprit jsprit
====== ======
jsprit is a java based, open source toolkit for solving a set of well-known [vehicle routing problems](http://neo.lcc.uma.es/vrp/vehicle-routing-problem/) (VRP). jsprit is a java based, open source toolkit for solving a set of well-known [vehicle routing problems](http://neo.lcc.uma.es/vrp/vehicle-routing-problem/) (VRP).
It is lightweight and easy-to-use, and based on heuristics currently solving the following problems: It is lightweight and easy-to-use, and based on heuristics currently solving
- [Capacitated VRP](http://neo.lcc.uma.es/vrp/vrp-flavors/capacitated-vrp/) - [Capacitated VRP](http://neo.lcc.uma.es/vrp/vrp-flavors/capacitated-vrp/)
- [Multiple Depot VRP](http://neo.lcc.uma.es/vrp/vrp-flavors/multiple-depot-vrp/) - [Multiple Depot VRP](http://neo.lcc.uma.es/vrp/vrp-flavors/multiple-depot-vrp/)
- [VRP with time windows](http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-time-windows/) - [VRP with time windows](http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-time-windows/)
- VRP with heterogeneous fleet - VRP with heterogeneous fleet
- Time-dependent VRP - Time-dependent VRP
Modifying the algorithms and visualising the discovered solutions is as easy and handy as and various combination of these problem types. Modifying the algorithms and visualising the discovered solutions is as easy and handy as
reading classical VRP instances to benchmark your algorithm. reading classical VRP instances to benchmark your algorithm.