Errand Route Optimizer
Finds the shortest order to visit a list of stops from a fixed start — a tiny travelling-salesman solver for errand day. Coordinates are plain x/y numbers in any unit: read them off any map tool, a store map or graph paper.
Read the full guide to this tool
Results
Notes
- Up to 12 stops the route is provably optimal (Held–Karp dynamic programming, the exact TSP algorithm). Beyond that the tool switches to nearest-neighbour construction plus 2-opt improvement — usually within a few percent of optimal, but not guaranteed.
- Distances are straight-line ("as the crow flies") between your coordinates; real road distances will differ where the street grid does.
Related tools
Shift Rota Builder
A fair weekly rota around everyone’s unavailable days.
Stable Matching Calculator
Gale–Shapley pairing from two sides of ranked preferences.
Round-Robin Schedule Generator
Everyone plays everyone: fixtures by the circle method, byes included.
Seating Chart Optimizer
Assign guests to tables around keep-together and keep-apart rules.
Secret Santa Generator
Draw gift-exchange pairs with exclusions, no self-draws guaranteed.
Voting Methods Lab
Drag candidates on an opinion map and watch plurality, runoff, Borda and Condorcet crown different winners.