Abstract
The Probabilistic Traveling Salesperson Problem (PTSP) is a stochastic variant of the Traveling Salesperson Problem (TSP); each customer has to be serviced only with a given probability. The goal is to find an a priori tour with shortest expected tour-length, with the customers being served in the specified order and customers not requiring service being skipped. In this paper, we use the Ant Colony Optimization (ACO) metaheuristic to construct solutions for PTSP. We propose two new heuristic guidance schemes for this problem, and examine the idea of using approximations to calculate the expected tour length. This allows to find better solutions or use less time than the standard ACO approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. J. Berstimas, P. Jaillet, and A. Odoni. A priori optimization. Operations Research, 38:1019–1033, 1990.
A. Jezequel. Probabilistic vehicle routing problems. Master’s thesis, Massachusetts Institute of Technology, Cambridge, MA, 1985.
F. Rossi and I. Gavioli. Aspects of heuristic methods in the probabilistic traveling salesman problem. Andreatta, G., F. Mason, and P. Serani (eds.), Advanced School on Stochastics in Combinatorial Optimization, World Scientic, Singapore, pp. 214–227, 1987.
D. Bertsimas and L. H. Howell. Further results on the probabilistic traveling salesman problem. European Journal of Operational Research, 65:68–95, 1993.
G. Laporte, F. V. Louveaux, and H. Mercure. A priori optimization of the probabilistic traveling salesman problem. Operations Research, 42(3):543–549, 1994.
L. Bianchi, L. M. Gambardella, and M. Dorigo. An ant colony optimization approach to the probabilistic traveling salesman problem. In J. J. Merelo Guervos et al., editor, Parallel Problem Solving from Nature, volume 2439 of LNCS, pages 883–892. Springer, 2002.
L. Bianchi, L. M. Gambardella, and M. Dorigo. Solving the homogeneous probabilistic traveling salesman problem by the aco metaheuristic. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Ant Algorithms, volume 2463 of LNCS, pages 176–187. Springer, 2002.
M. Dorigo. Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992. pp. 140.
A. Colorni M. Dorigo, V. Maniezzo. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, B(26):29–41, 1996.
M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages11–32. McGraw-Hill, 1999.
P. Jaillet. Probabilistic traveling salesman problems. PhD thesis, MIT, Cambridge, MA, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Branke, J., Guntsch, M. (2003). New Ideas for Applying Ant Colony Optimization to the Probabilistic TSP. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_16
Download citation
DOI: https://doi.org/10.1007/3-540-36605-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00976-4
Online ISBN: 978-3-540-36605-8
eBook Packages: Springer Book Archive