// the find
graphhopper/jsprit
jsprit is a java based, open source toolkit for solving rich vehicle routing problems
jsprit is a Java library for solving vehicle routing problems — the class of problems where you need to assign stops to vehicles and sequence them optimally under constraints like capacity, time windows, and pickup/delivery pairing. It's for logistics software, academic research, or any scheduling problem that maps onto VRP. The 2.0 release (April 2026) is a meaningful update with a new operator API and event system.
The algorithm decomposition is genuinely good: ruin-and-recreate with independently configurable ruin strategies (radial, random, worst) and insertion strategies (best, regret-k) lets you tune the search without rewriting the core. The regret-k insertion is worth calling out specifically — it's a meaningful improvement over greedy cheapest insertion for hard instances. The new event system makes introspecting the search tractable, which most open-source VRP solvers skip entirely. Test coverage appears solid with a clear modular structure across core, analysis, and instance-reading modules.
The library assumes Euclidean or pre-computed travel costs — plugging in real road network distances requires implementing your own cost matrix or wiring GraphHopper in separately, which the docs underexplain. Parallelism is bolted on (concurrent insertion variants exist but the algorithm itself runs single-threaded by default), so large real-world instances with thousands of stops will be slow without careful configuration. Documentation is a mix of Textile and Markdown files in the repo with no hosted site; the 'Getting Started' is thin and the migration guide from 1.x doesn't cover every API change. There's no built-in support for stochastic or dynamic VRP (jobs arriving in real time), which rules it out for a real dispatch system without significant extension.