CoDE Publications CoDE Publications
IRIDIA Publications IRIDIA Publications
SMG Publications
WIT Publications
WIT Publications
SMG Publications
Home People Research Activities Publications Teaching Resources
By Class By Topic By Year Technical Reports
By Class By Topic By Year Technical Reports
login
P. Balaprakash, M. Birattari, T. Stützle, and M. Dorigo. An Experimental Study of Estimation-based Metaheuristics for the Probabilistic Traveling Salesman Problem. Technical Report TR/IRIDIA/2007-021, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium, December 2007.

Abstract

The probabilistic traveling salesman problem (PTSP), a paradigmatic example of a stochastic combinatorial optimization problem, is used to study routing problems under uncertainty. Recently, we introduced a new estimation-based iterative improvement algorithm for the PTSP and we showed that it outperforms for a number of instance classes the previous state-of-the-art algorithms. In this paper, we integrate this estimation-based iterative improvement algorithm into some metaheuristics to solve the PTSP and we study their performance.


Updated: 2017-03-27