jsprit

jsprit is a java based, open source toolkit for solving a set of well-known vehicle routing problems (VRP). It is lightweight and easy-to-use, and based on heuristics currently solving

• Capacitated VRP
• Multiple Depot VRP
• VRP with time windows
• VRP with heterogeneous fleet
• Time-dependent VRP
• Various combination of these types

Modifying the algorithms and visualising the discovered solutions is as easy and handy as 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 (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

• VRP with Backhauls
• Pickup and Delivery

##License This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

For more information, please visit GNU Public License.

##Documentation

Please visit jsprit-wiki to learn more.

##Getting started in 2 seconds

Add the latest snapshot to your pom.

##About The jsprit-project is created and maintained by Stefan Schröder. It is motivated by two issues.

First, there is an almost endless list of papers and algorithms to tackle vehicle routing problems, BUT there are (as far as I know) only a very few open source implementations of one of these thousands algorithms.

Second, it is motivated by my PhD-project at KIT where I apply vehicle routing algorithms to solve behavioural models of freight agents to assess (freight) transport policy measures.

It is mainly inspired by my research group at KIT-ECON, and by an awesome open-source project called MATSim and its developers.

Email: jsprit.vehicle.routing@gmail.com