New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem

In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both runtime and solution quality of state-of-the-art local search algorithms for the PTSP.

• Type: Conference
• Year: 2009
• Where: EUROCAST
• Authors: Dennis Weyland, Leonora Bianchi, Luca Maria Gambardella
• Keywords: EUROCAST 2009, Hardware, Local Search Algorithms, Probabilistic Traveling Salesman, State-of-the-art Local Search