Home
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 (Deliveries first)
- VRP with Backhauls (mixed Pickups and Deliveries)
- 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.
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.
Setting up jsprit and the like.
Gives a basic description of the applied meta-heuristic and shows how to configure it.
Shows a set of algorithm configurations benchmarked against classical benchmarking instances and their performances. These configurations are ready to use, i.e. you can load and use them within seconds.
Describes the modules jsprit consists of and their according dependencies.
Build the code (to develop it).
If you want to contribute (which would be great) or customize jsprit, checkout and build the code.