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

Worked examples · reproducible sample data

Worked decisions, with the assumptions left in

Reproducible examples showing where the data came from, which rules were applied, what alternatives were considered and why the recommendation passed its checks.

Illustrative examples, not customer data. Real recommendations are generated from your own inputs.

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

Run the same path on a decision of your own.