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:50:08 +03:00
parent 83a02a37e6
commit b0de3eef86
1 changed files with 2 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

3
README.md
View file

@ -7,8 +7,9 @@ It is lightweight and easy-to-use, and based on heuristics currently solving
- [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
- Various combination of these types
and various combination of these problem types. Modifying the algorithms and visualising the discovered solutions is as easy and handy as 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.