Comment on Traveling Salesman is NP-Hard, yet Uber Eats delivery route optimization algorithms exist
Danitos@reddthat.com 4 days ago
Algorithms that find approximate solutions to Traveling Businessman Problem are handful (some just use Markov Chains, a rather easy topic). Finding the exact solution is a hell lot harder.
If your solution has an estimated error margin of 2% or less, it works just fine for basically any practical purpose.