From 2a2c52bfce7103062d4cae3f11ba63b4235e7fe0 Mon Sep 17 00:00:00 2001 From: jsprit Date: Mon, 27 Jan 2014 11:18:14 +0100 Subject: [PATCH] Update README.md --- README.md | 4 ---- 1 file changed, 4 deletions(-) diff --git a/README.md b/README.md index e3a3cbc5..22d84746 100644 --- a/README.md +++ b/README.md @@ -16,10 +16,6 @@ It is lightweight, flexible and easy-to-use, and based on a single all-purpose < 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 design and a comprehensive set of unit and integration-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* -can be used, and a dynamic and interactive visualiser greatly enhances the analysis. - ##In Development - continues improvement of code, handling and performance - soft constraints