From af65c7bd3880c90e835ce4ae02e86166fffd6d77 Mon Sep 17 00:00:00 2001
From: oblonski <4sschroeder@gmail.com>
Date: Mon, 6 Jan 2014 12:47:00 +0100
Subject: [PATCH] update
---
README.md | 8 ++++----
1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/README.md b/README.md
index 9b7fc759..a065e3d2 100644
--- a/README.md
+++ b/README.md
@@ -1,7 +1,7 @@
jsprit
======
-jsprit is a java based, open source toolkit for solving a set of well-known traveling salesman (TSP) and vehicle routing problems (VRP).
-It is lightweight and easy-to-use, and based on heuristics currently solving
+jsprit is a java based, open source toolkit for solving rich traveling salesman (TSP) and vehicle routing problems (VRP).
+It is lightweight, flexible and easy-to-use, and based on heuristics currently solving
- Capacitated VRP
- Multiple Depot VRP
- VRP with Time Windows
@@ -13,8 +13,8 @@ It is lightweight and easy-to-use, and based on heuristics currently solving
- Dial-a-Ride Problem
- Various combination of these types
-Setting up the problem, modifying the algorithms and visualising the discovered solutions is as easy and handy as
-reading classical VRP instances to benchmark your algorithm.
+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-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*