Sciweavers

Share
EUROCAST
2009
Springer

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

10 years 9 months ago
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.
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where EUROCAST
Authors Dennis Weyland, Leonora Bianchi, Luca Maria Gambardella
Comments (0)
books