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 2014-01-05 09:49:23 +01:00
parent aa40770c70
commit 3f872e42fc
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
README.md
View file

@ -14,7 +14,7 @@ It is lightweight, flexible and easy-to-use, and based on heuristics currently s
- Various combination of these types - Various combination of these types
Setting up the problem, defining additional constraints, modifying the algorithms and visualising the discovered solutions is as easy and handy as Setting up the problem, defining additional constraints, 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. It is fit for change and extension due to a modular approach and a comprehensive set of unit-tests.
Additionally, jsprit can be used along with <a href="http://www.matsim.org" target="blank_">MATSim</a> Additionally, jsprit can be used along with <a href="http://www.matsim.org" target="blank_">MATSim</a>
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* 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*