Abstract
The Clustered Traveling Salesman Problem is an extension of the classical Traveling Salesman Problem, where the set vertices is partitioned into clusters. The goal is to find the shortest tour in such a way that all vertices of each cluster are visited contiguously. In this paper, a genetic algorithm is proposed to solve this problem. Computational results are reported on a set of Euclidean problems, and comparisons are provided with another recent heuristic.
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
J.E. Baker, Adaptive selection methods for genetic algorithms, in: Proceedings of the First International Conference on Genetic Algorithms, ed. J.J. Grefenstette (Lawrence Erlbaum Associates, Hillsdale, NJ, 1985) p. 101.
J.E. Baker, Reducing bias and inefficiency in the selection algorithm, in: Proceedings of the Second International Conference on Genetic Algorithms, ed. JJ. Grefenstette (Lawrence Erlbaum Associates, Hillsdale, NJ, 1987) p. 14.
J.A. Chisman, The clustered traveling salesman problem, Computers & Operations Research 2 (1975) 115.
M. Gendreau, A. Hertz and G. Laporte, New insertion and postoptimization procedures for the traveling salesman problem, Operations Research 40 (1992) 1086.
M. Gendreau, G. Laporte and J.Y. Potvin, Heuristics for the clustered traveling salesman problem, Technical report, CRT-94–54, Centre de recherche sur les transports, Université de Montréal, Montréal, Canada (1994).
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, (Addison Wesley, Reading, MA, 1989).
K. Jongens and T. Volgenant, The symmetric clustered traveling salesman problem, European Journal of Operational Research 19 (1985) 68.
F.C.J. Lokin, Procedures for travelling salesman problems with additional constraints, European Journal of Operational Research 3 (1978) 135.
D. Whitley, The genitor algorithm and selection pressure: why rank-based allocation of reproductive trials is best, in: Proceedings of the Third International Conference on Genetic Algorithms, ed. J.D. Schaffer (Morgan Kaufmann Publishers, San Mateo, CA, 1989) p. 116.
D. Whitley, T. Starkweather and D. Fuquay, Scheduling problems and traveling salesmen: the genetic edge recombination operator, in: Proceedings of the Third International Conference on Genetic Algorithms, ed. J.D. Schaffer (Morgan Kaufmann Publishers, San Mateo, CA, 1989) p. 133.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Potvin, JY., Guertin, F. (1996). The Clustered Traveling Salesman Problem: A Genetic Approach. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_37
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_37
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive