Paper Info
Title
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem
Abstract
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.
Year
DOI
Venue
2009
10.1007/978-3-642-04772-5_88
EUROCAST
Keywords
Field
DocType
ad-hoc approximation,state-of-the-art local search algorithm,new local search algorithm,new approximation-based local search,solution quality,salesman problem,local search algorithm,traveling salesman problem
Nearest neighbour algorithm,Traveling purchaser problem,Bottleneck traveling salesman problem,Computer science,Theoretical computer science,Travelling salesman problem,Artificial intelligence,Mathematical optimization,Algorithm,Probabilistic analysis of algorithms,Local search (optimization),2-opt,Tabu search,Machine learning
Conference
Volume
ISSN
Citations 
5717
0302-9743
7
PageRank 
References 
Authors
0.49
5
3
Name
Order
Citations
PageRank
Dennis Weyland11088.43
Leonora Bianchi232914.59
Luca Maria Gambardella37926726.40