Abstract
The traveling salesman problem is a very popular combinatorial optimization problem in fields such as computer science, operations research, mathematics and optimization theory. Given a list of cities and the distances between any city to another, the objective of the problem is to find the optimal permutation (tour) in the sense of minimum traveled distance when visiting each city only once before returning to the starting city. Because many real-world problems can be modeled to fit this formulation, the traveling salesman problem has applications in challenges related to planning, routing, scheduling, manufacturing, logistics, and other domains. Moreover, the traveling salesman problem serves as a benchmark problem for optimization methods and algorithms, including the genetic algorithm. In this paper, we examine various implementations of the genetic algorithm for solving two examples of the traveling salesman problem. Specifically, we compare commonly employed methods of partially mapped crossover and order crossover with an alternative encoding scheme that allows for single-point, multipoint, and uniform crossovers. In addition, we examine several mutation methods, including Twors mutation, center inverse mutation, reverse sequence mutation, and partial shuffle mutation. We empirically compare the implementations in terms of the chosen crossover and mutation methods to solve two benchmark variations of the traveling salesperson problem. The experimental results show that the genetic algorithm with order crossover and the center inverse mutation method provides the best solution for the two test cases.
This research was supported by the European Research Consortium for Informatics and Mathematics (ERCIM).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
O. Abdoun, J. Abouchabaka, in A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. arXiv preprint arXiv:1203.3097 (2012)
O. Abdoun, J. Abouchabaka, C. Tajani, in Analyzing the performance of mutation operators to solve the travelling salesman problem. arXiv preprint arXiv:1203.3099 (2012)
R.T. Bye, A receding horizon genetic algorithm for dynamic resource allocation: a case study on optimal positioning of tugs, in Computational Intelligence. (Springer, Berlin, 2012), pp. 131–147
R.T. Bye, O.L. Osen, B.S. Pedersen, I.A. Hameed, H.G. Schaathun, A software framework for intelligent computer-automated product design, in Proceedings of the 30th European Conference on Modelling and Simulation (ECMS ’16) (June 2016), pp. 534–543
R.T. Bye, O.L. Osen, W. Rekdalsbakken, B.S. Pedersen, I.A. Hameed, An intelligent winch prototyping tool, in Proceedings of the 31st European Conference on Modelling and Simulation (ECMS ’17) (May 2017), pp. 276–284
R.T. Bye, H.G. Schaathun, Evaluation heuristics for tug fleet optimisation algorithms: a computational simulation study of a receding horizon genetic algorithm, in Proceedings of the 4th International Conference on Operations Research and Enterprise Systems (ICORES ’15) (2015), pp. 270–282 (Selected for extended publication in Springer book series Communications in Computer and Information Science (CCIS))
R.T. Bye, H.G. Schaathun, An improved receding horizon genetic algorithm for the tug fleet optimisation problem, in Proceedings 28th European Conference on Modelling and Simulation (ECMS 2014), Brescia, Italy, May 27–30, 2014 (ECMS European Council for Modelling and Simulation, 2014)
D.E. Goldberg, Genetic algorithms in search, in Optimization and Machine Learning (Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA, 1989)
D.E. Goldberg, R. Lingle, et al., Alleles, loci, and the traveling salesman problem, in Proceedings of an International Conference on Genetic Algorithms and Their Applications, vol. 154 (Lawrence Erlbaum, Hillsdale, NJ, 1985), pp. 154–159
E.D. Goodman, Introduction to genetic algorithms, in Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO Comp ’14) ( ACM, New York, NY, USA, 2014), pp. 205–226
J. Grefenstette, R. Gopal, B. Rosmaita, D. Van Gucht, Genetic algorithms for the traveling salesman problem, in Proceedings of the First International Conference on Genetic Algorithms and their Applications, vol. 160 (1985), pp. 160–168
U. Hacizade, I. Kaya, Ga based traveling salesman problem solution and its application to transport routes optimization. IFAC-PapersOnLine 51(30), 620–625 (2018)
I.A. Hameed, R.T. Bye, O.L. Osen, O.L., Pedersen, B.S., Schaathun, H.G.: Intelligent computer-automated crane design using an online crane prototyping tool, in Proceedings of the 30th European Conference on Modelling and Simulation (ECMS’16) (June 2016), pp. 564–573 (Best Paper Nominee)
I.A. Hameed, R.T. Bye, B.S. Pedersen, O.L. Osen, Evolutionary winch design using an online winch prototyping tool, in Proceedings of the 31st European Conference on Modelling and Simulation (ECMS’17) (May 2017), pp. 292–298
J.H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence (University of Michigan Press, Oxford, England, 1975)
A. Hussain, Y.S. Muhammad, M. Nauman Sajid, I. Hussain, A. Mohamd Shoukry, S. Gani, Genetic algorithm for traveling salesman problem with modified cycle crossover operator. Comput. Intell. Neurosci. 2017 (2017)
P. Larranaga, C.M.H. Kuijpers, R.H. Murga, I. Inza, S. Dizdarevic, Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif. Intell. Rev. 13(2), 129–170 (1999)
G. Li, H. Zhang, J. Zhang, R.T. Bye, Development of adaptive locomotion of a caterpillar-like robot based on a sensory feedback CPG model. Adv. Robot. 28(6), 389–401 (2014)
B.L. Lin, X. Sun, S. Salous, Solving travelling salesman problem with an improved hybrid genetic algorithm. J. Comput. Commun. 4(15), 98–106 (2016)
S. Mirjalili, Evolutionary multi-layer perceptron, in Evolutionary Algorithms and Neural Networks (Springer, Berlin, 2019), pp. 87–104
N.M. Razali, J. Geraghty, et al., Genetic algorithm performance with different selection strategies in solving TSP, in Proceedings of the World Congress on Engineering, vol. 2 (International Association of Engineers, Hong Kong, 2011)
L.D. Whitley, T. Starkweather, D. Fuquay, Scheduling problems and traveling salesmen: the genetic edge recombination operator. ICGA 89, 133–40 (1989)
J. Xu, L. Pei, R. Zhu, Application of a genetic algorithm with random crossover and dynamic mutation on the travelling salesman problem. Proc. Comput. Sci. 131, 937–945 (2018)
J. Yang, X. Shi, M. Marchese, Y. Liang, An ant colony optimization method for generalized tsp problem. Progr. Nat. Sci. 18(11), 1417–1422 (2008)
G. Üçoluk, Genetic algorithm solution of the TSP avoiding special crossover and mutation. Intell. Autom. Soft Comput. 8(3), 265–272 (2002)
Acknowledgements
This research was supported by the European Research Consortium for Informatics and Mathematics (ERCIM), which provided funding to Ramesh Chandra for his postdoctoral fellowship at the CPS Lab at NTNU, Ålesund, Norway.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Bye, R.T., Gribbestad, M., Chandra, R., Osen, O.L. (2021). A Comparison of GA Crossover and Mutation Methods for the Traveling Salesman Problem. In: Sharma, M.K., Dhaka, V.S., Perumal, T., Dey, N., Tavares, J.M.R.S. (eds) Innovations in Computational Intelligence and Computer Vision. Advances in Intelligent Systems and Computing, vol 1189. Springer, Singapore. https://doi.org/10.1007/978-981-15-6067-5_60
Download citation
DOI: https://doi.org/10.1007/978-981-15-6067-5_60
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-6066-8
Online ISBN: 978-981-15-6067-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)