We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including the backbone and optimal tour cost, experience sharp transitions as the precision of intercity distances increases across a critical value. We also show that the average computational cost of the well-known branch-and-bound subtour elimination algorithm for the problem also exhibits a threshold behavior, transitioning from easy to difficult as the distance precision increases. These results provide strong positive evidences to a decade-long open question regarding the existence of phase transitions of the Traveling Salesman.
|Number of pages||6|
|Journal||IJCAI International Joint Conference on Artificial Intelligence|
|State||Published - 2003|
|Event||18th International Joint Conference on Artificial Intelligence, IJCAI 2003 - Acapulco, Mexico|
Duration: Aug 9 2003 → Aug 15 2003