Abstract
The formal structure of the probabilistic traveling salesman problem (PTSP) is a generalization of the traveling salesman problem (TSP). The basis of the PTSP is a TSP with stochastic customers (TSPCS), so that the traveling salesman has to visit city i in a tour only with probabilitypi — corresponding to the actual demand of the customers.
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.
References
Bertsimas D.J.: Probabilistic Combinatorial Optimization Problems, Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts, Ph.D. Thesis, 1988
Grefenstette J., Gopal R., Rosmaita B., Van Gucht D.: Genetic Algorithms for the Traveling Salesman Problem, in: Grefenstette J. (Ed.), Proceedings of the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, New York, 1985, 160–168
Jaillet P.: Probabilistic traveling salesman problems, Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts, Ph.D. Thesis, 1985
Rosenow S.: A heuristic for the probabilistic traveling salesman problem, in: Zimmermann U., Derigs U., Gaul W., Möhring R.H., Schuster K.-P. (Eds), Operations Research Proceedings 1996, Springer, 1997, 117–122
Whitley D., Starkweather T., Fuquay D.: Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator, in: Schaffer J. (Ed.), Proceedings of the Third Intenational Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, CA, 1989, 133–140
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosenow, S. (1999). Comparison of an Exact Branch-and-Bound and an Approximative Evolutionary Algorithm for the Probabilistic Traveling Salesman Problem. In: Kall, P., Lüthi, HJ. (eds) Operations Research Proceedings 1998. Operations Research Proceedings 1998, vol 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58409-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-58409-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65381-3
Online ISBN: 978-3-642-58409-1
eBook Packages: Springer Book Archive