Planning the best route with multiple destinations is hard even for supercomputers – a new approach breaks a barrier that's stood for nearly half a century

theconversation.com · 1,473 words · saved by 1 readers

The traveling salesperson problem is so difficult that practical solutions can never be perfect – only good enough. The challenge is coming up with the best approximations.

Finding the best tour from A through B, C and D and back to A might not be that hard, but adding a few more destinations could give you a headache. wundervisuals/E+ via Getty Images https://theconversation.com/planning-the-best-route-with-multiple-destinations-is-hard-even-for-supercomputers-a-new-approach-breaks-a-barrier-thats-stood-for-nearly-half-a-century-148308 https://theconversation.com/planning-the-best-route-with-multiple-destinations-is-hard-even-for-supercomputers-a-new-approach-breaks-a-barrier-thats-stood-for-nearly-half-a-century-148308 Link copied Share article Share article Co

Planning the best route with multiple destinations is hard even for supercomputers – a new approach breaks a barrier that's stood for nearly half a century

related reading