Tag Archives: vehicle routing problem

jsprit 2.0 Released

| 30. March 2026

After 6 years since the last major release, we’re excited to announce jsprit 2.0, a significant update to the open-source vehicle routing library. Modern Java Foundation jsprit now requires Java 21. Composable Ruin & Recreate Operators Independently select and weight ruin and insertion strategies: Jsprit.Builder.newInstance(vrp) .addRuinOperator(0.3, Ruin.radial(0.3, 0.5, 10, 70)) .addRuinOperator(0.2, Ruin.kruskalCluster()) .addInsertionOperator(0.7, Insertion.regretFast()) .addInsertionOperator(0.3, […]

New Feature: Balance Workloads Across Your Drivers

| 26. February 2026

Suppose you have a fleet of 5 drivers and 50 delivery stops. You want each driver to have a fair share of work — not one driver working 10 hours while another finishes in 2. Until now, you could use min-max to minimize the longest route. But min-max only cares about the maximum — it […]

Understanding Stop Timing: A New Feature for Location Overhead

| 10. February 2026

When optimizing delivery routes, not all time spent at a stop is the same. Over the years, we’ve added several timing parameters to model real-world scenarios more accurately. With our latest addition, setup_time, we now cover another common case: fixed overhead when arriving at a location. The Timeline at a Stop Let me walk through […]

A TSP game I wanted for 10 years — built in 4 hours

| 8. December 2025

For a decade, I’ve wanted to build a simple game that shows why the Traveling Salesman Problem is fun to work on. Something I could pull up at a party when someone asks “so what does your company actually do?” Something my kids could play and understand why dad stares at vehicle routing problems all […]

Our Latest Performance Improvement: Solving Traveling Salesman Problems Up To 50% Faster

| 6. March 2023

We are constantly working to improve our software to better serve our customers. We solve millions of vehicle routing problems every day. Over 90% of these problems are actually variations of the famous traveling salesman problem, which requires finding the shortest possible route that visits all the locations exactly once. As we see these problems […]

Findings on Route Optimization in Practice – Part 1

| 19. January 2022