Abstract
The Probabilistic Traveling Salesman Problem (PTSP) is a TSP problem where each customer has a given probability of requiring a visit. The goal is to find an a priori tour of minimal expected length over all customers, with the strategy of visiting a random subset of customers in the same order as they appear in the a priori tour.
We address the question of whether and in which context an a priori tour found by a TSP heuristic can also be a good solution for the PTSP. We answer this question by testing the relative performance of two ant colony optimization algorithms, Ant Colony System (ACS) introduced by Dorigo and Gambardella for the TSP, and a variant of it (pACS) which aims to minimize the PTSP objective function.
We show in which probability configuration of customers pACS and ACS are promising algorithms for the PTSP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. J. Bertsimas, P. Jaillet, and A. Odoni. A priori optimization. Operations Research, 38:1019–1033, 1990.
D. J. Bertsimas. Probabilistic Combinatorial Optimization Problems. PhD thesis, MIT, Cambridge, MA, 1988.
P. Jaillet. Probabilistic Traveling Salesman Problems. PhD thesis, MIT, Cambridge, MA, 1985.
A. Jézéquel. Probabilistic Vehicle Routing Problems. Master’s thesis, MIT, Cambridge, MA, 1985.
F. A. Rossi and I. Gavioli. Aspects of Heuristic Methods in the Probabilistic Traveling Salesman Problem, pages 214–227. World Scientific, Singapore, 1987.
D. J. Bertsimas and L. Howell. Further results on the probabilistic traveling salesman problem. European Journal of Operational Research, 65:68–95, 1993.
G. Laporte, F. Louveaux, and H. Mercure. An exact solution for the a priori optimization of the probabilistic traveling salesman problem. Operations Research, 42:543–549, 1994.
M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5(2):137–172, 1999.
L. M. Gambardella and M. Dorigo. Solving symmetric and asymmetric TSPs by ant colonies. In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation (ICEC'96), pages 622–627. IEEE Press, Piscataway, NJ, 1996.
M. Dorigo and L. M. Gambardella. Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53–66, 1997.
M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics — Part B, 26(1):29–41, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bianchi, L., Gambardella, L.M., Dorigo, M. (2002). An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_85
Download citation
DOI: https://doi.org/10.1007/3-540-45712-7_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44139-7
Online ISBN: 978-3-540-45712-1
eBook Packages: Springer Book Archive