Comment on Traveling Salesman is NP-Hard, yet Uber Eats delivery route optimization algorithms exist

solrize@lemmy.world ⁨1⁩ ⁨day⁩ ago

Actual difficult instances of TSP are pretty rare, and for something like Uber Eats, it’s fine if your route is 2% worse than the mathematical optimum. Traffic fluctuations probably matter more than having the shortest route.

There are many good heuristics for TSP that might not give you the optimal solution, but that will generally come pretty close. The Wikipedia article probably describes some of these.

source
Sort:hotnewtop