From 8ca89b9c232b7c8549259cef1075707e3cbf2581 Mon Sep 17 00:00:00 2001 From: jsprit Date: Sun, 5 Jan 2014 21:52:26 +0100 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index cd98a9d2..a065e3d2 100644 --- a/README.md +++ b/README.md @@ -14,7 +14,7 @@ It is lightweight, flexible and easy-to-use, and based on heuristics currently s - 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 -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. +reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to a modular design and a comprehensive set of unit-tests. 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*