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

Authors:
Dennis Weyland;Leonora Bianchi;Luca Maria Gambardella
Affiliations:
IDSIA, Dalle Molle Institute for Artificial Intelligence,;IDSIA, Dalle Molle Institute for Artificial Intelligence,;IDSIA, Dalle Molle Institute for Artificial Intelligence,
Venue:
Computer Aided Systems Theory - EUROCAST 2009
Year:
2009

Citing 0
Cited 3

Hardness results for the probabilistic traveling salesman problem with deadlines

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines

Journal of Parallel and Distributed Computing
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.