jsprit

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 a single all-purpose meta-heuristic currently solving

• Capacitated VRP
• Multiple Depot VRP
• VRP with Time Windows
• VRP with Backhauls
• VRP with Pickups and Deliveries
• VRP with Heterogeneous Fleet
• Time-dependent VRP
• Traveling Salesman Problem
• Dial-a-Ride Problem
• 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 design and a comprehensive set of unit and integration-tests. More features ...

##Documentation

Please visit jsprit-wiki to learn more.

##License This software is released under LGPL.

##Get Started

##Contributors Pierre-David Bélanger
Abraham Gausachs
Subhamay Das

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

First, you can find vehicle routing problems everywhere in the world of distributing and moving things and people. This probably explains why there is an almost endless list of papers and algorithms to tackle these problems. However there are only very few open source implementations and even fewer projects that can deal with real world problems that usually have many side-constraints.

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 a great open-source project called MATSim and its developers.

If you have questions or if you use jsprit, it would be great you give feedback and let me know your experience:

Email: info@jspr.it