Estimation-based metaheuristics for the probabilistic traveling salesman problem

Authors:
Prasanna Balaprakash;Mauro Birattari;Thomas Stützle;Marco Dorigo
Affiliations:
IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium;IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium;IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium;IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium
Venue:
Computers and Operations Research
Year:
2010

Citing 15
Cited 5

A priori solution of a travelling salesman problem in which a random subset of the customers are visited

Operations Research
The Sample Average Approximation Method for Stochastic Discrete Optimization

SIAM Journal on Optimization
An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
A Racing Algorithm for Configuring Metaheuristics

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Ant Colony Optimization

Ant Colony Optimization
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Aggregation for the probabilistic traveling salesman problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A hybrid scatter search for the probabilistic traveling salesman problem

Computers and Operations Research
MPFR: A multiple-precision binary floating-point library with correct rounding

ACM Transactions on Mathematical Software (TOMS)
Tuning Metaheuristics: A Machine Learning Perspective

Tuning Metaheuristics: A Machine Learning Perspective
A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem

Computers and Operations Research
New ideas for applying ant colony optimization to the probabilistic TSP

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Improvement strategies for the F-Race algorithm: sampling design and iterative refinement

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Using statistical tests for improving state-of-the-art heuristics for the probabilistic traveling salesman problem with deadlines

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
DOE-based parameter tuning for local branching algorithm

International Journal of Metaheuristics
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
DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The probabilistic traveling salesman problem (PTSP) is a central problem in stochastic routing. Recently, we have shown that empirical estimation is a promising approach to devise highly effective local search algorithms for the PTSP. In this paper, we customize two metaheuristics, an iterated local search algorithm and a memetic algorithm, to solve the PTSP. This customization consists in adopting the estimation approach to evaluate the solution cost, exploiting a recently developed estimation-based local search algorithm, and tuning the metaheuristics parameters. We present an experimental study of the estimation-based metaheuristic algorithms on a number of instance classes. The results show that the proposed algorithms are highly effective and that they define a new state-of-the-art for the PTSP.