Skip to main content
EN/FR/ES/DE interface · every recommendation checked against your business rules

Interactive examples · no account needed

Six real decisions, solved in front of you.

Every example uses reproducible sample data and shows the inputs, rules, alternatives and checks — small enough to verify on paper. No account required. Change an input and watch the answer move.

Worked samples, not customer data. Real recommendations are generated from your own inputs.

RoutingStops, fleets, time windows, capacities, depots, pickup and delivery.

The brief, in plain language
One van, five drop-offs, back to the depot. The stops sit on a city grid — A(2,4), B(5,1), C(6,5), D(1,7), E(8,3), depot at (0,0) — and driving distance is the grid distance in km. Which order is shortest?
  1. Reading
  2. Checking
  3. Computing
  4. Verifying
  5. Ready

The answer

The shortest round possible — all 120 stop orders were measured, and none beats 32 km.

32 kmRound distance
  • Drive Depot → A → D → C → E → B → Depot
  • Legs: 6 + 4 + 7 + 4 + 5 + 6 = 32 km
  • Longest leg: D → C at 7 km

Driving the stops in list order (A, B, C, D, E): 46 km — 14 km longer.

Add a sixth stop at (4,8) and the best round grows only 2 km, to 34 km.

Stops on the round

Your turn

Now do this with your data

These six fit on a napkin. Yours have hundreds of stops, shifts, and line items — and the loop that solved these handles those too.