diff --git a/README.md b/README.md index d826a36b..865a27a8 100644 --- a/README.md +++ b/README.md @@ -13,7 +13,7 @@ Modifying the algorithms and visualising the discovered solutions is as easy and 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 (OSM networks are supported as well). A variety of least cost path algorithms such as Dijkstra and A* +to solve the above problem-types in real networks (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