Solved: The 81,998-Bar Korean Pub Crawl – A TSP Milestone

A team has solved the Traveling Salesperson Problem (TSP) for 81,998 bars in South Korea, finding the shortest possible route to visit them all. The total walking time is a staggering 178 days, though practically impossible to complete in such a timeframe. The solution's precision, however, proves its optimality, surpassing the previous record of 57,912 stops in the Netherlands. The team employed the LKH and Concorde algorithms, combined with the 'cutting-plane method', demonstrating that even with an astronomically large number of possibilities, optimal solutions can be found. This showcases a significant advancement in solving large-scale optimization problems.