Question 1

Which algorithm should I use for my routing problem?

Accepted Answer

For < 15 stops, Nearest Neighbor gives quick results within 20-25% of optimal. For 15-50 stops, Clarke-Wright Savings followed by 2-opt improvement typically achieves within 5-10% of optimal. For 50+ stops, use metaheuristics (genetic algorithm, simulated annealing) or commercial solvers like Google OR-Tools.

Question 2

How is TSP different from real-world delivery routing?

Accepted Answer

Real routing adds time windows, vehicle capacity, driver hours, traffic, one-way streets, and multiple vehicles (making it VRP). TSP is the foundation, but practical routing software layers these constraints on top. Still, TSP solutions provide the distance lower bound for benchmarking.