Abstract
The Clustered Traveling Salesman Problem is an extension of the classical Traveling Salesman Problem, where the set of vertices is partitioned into clusters. The goal is to find the shortest tour such that the clusters are visited in a prespecified order and all vertices within 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 a comparison is provided with a 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
Baker, J.E. (1985), Adaptive Selection Methods for Genetic Algorithms, in Proceedings of the Int. Conf. on Genetic Algorithms, Pittsburgh, PA, 101–111.
Baker, J.E. (1987), Reducing Bias and Inefficiency in the Selection Algorithm, in Proceedings of the Second Int. Conf. on Genetic Algorithms, Cambridge, MA, 14–21.
Chisman, J.A. (1975), The Clustered Traveling Salesman Problem, Computers & Operations Research 2, 115–119.
Gendreau, M., A. Hertz and G. Laporte (1992), New Insertion and Postoptimization Procedures for the Traveling Salesman Problem, Operations Research 40, 1086 1094.
Gendreau, M., G. Laporte and J.Y. Potvin (1994), Heuristics for the Clustered Traveling Salesman Problem, Technical Report CRT-94–54, Centre de recherche sur les transports, Université de Montréal.
Goldberg, D.E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Reading: Addison Wesley.
Holland, J.H. (1975), Adaptation in Natural and Artificial Systems, The University of Michigan Press: Ann Arbor.
Jongens, K. and T. Volgenant (1985), The Symmetric Clustered Traveling Salesman Problem, European Journal of Operational Research 19, 68–75.
Lin, S. (1965), Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal 44, 2245–2269.
Little, J.D.C., K.G. Murty, D.W. Sweeney and C. Karel (1963), An Algorithm for the Traveling Salesman Problem, Operations Research 11, 972–989.
Lokin, F.C.J. (1978), Procedures for Travelling Salesman Problems with Additional Constraints, European Journal of Operational Research 3, 135–141.
Michalewicz, Z. (1992), Genetic Algorithms + Data Structures = Evolution Programs, Berlin: Springer-Verlag.
Syswerda, G. (1989), Uniform crossover in Genetic Algorithms, in Proceedings of the Third Int. Conf. on Genetic Algorithms, Fairfax, VA, 2–9.
Whitley, D. (1989), The Genitor Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best, in Proceedings of the Third Int. Conf. on Genetic Algorithms, Fairfax, VA, 116–121.
Whitley, D., T. Starkweather and D. Fuquay (1989), Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator, in Proceedings of the Third Int. Conf. on Genetic Algorithms, Fairfax, VA, 133–140.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Potvin, JY., Guertin, F. (1998). A Genetic Algorithm for the Clustered Traveling Salesman Problem with a Prespecified Order on the Clusters. In: Woodruff, D.L. (eds) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search. Operations Research/Computer Science Interfaces Series, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2807-1_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2807-1_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5023-9
Online ISBN: 978-1-4757-2807-1
eBook Packages: Springer Book Archive