Skip to main content
View expanded cover

Innovations in Computational Intelligence and Computer Vision pp 529–542Cite as

A Comparison of GA Crossover and Mutation Methods for the Traveling Salesman Problem

Part of the Advances in Intelligent Systems and Computing book series (AISC,volume 1189)

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.

Keywords

  • TSP
  • Genetic algorithm
  • Crossover
  • Mutation
  • Permutations
  • Inversion sequence

This research was supported by the European Research Consortium for Informatics and Mathematics (ERCIM).

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-981-15-6067-5_60
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   219.00
Price excludes VAT (USA)
  • ISBN: 978-981-15-6067-5
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   279.99
Price excludes VAT (USA)
Learn about institutional subscriptions
Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.
Fig. 10.
Fig. 11.

Notes

  1. 1.

    Wikipedia: https://en.wikipedia.org/wiki/Travelling_salesman_problem.

  2. 2.

    https://www.ntnu.no/blogger/cpslab/.

  3. 3.

    http://www.math.uwaterloo.ca/tsp.

  4. 4.

    E.g., see Wikipedia: https://en.wikipedia.org/wiki/Inversion_(discrete_mathematics).

References

  1. 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)

  2. 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)

  3. 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

    Google Scholar 

  4. 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

    Google Scholar 

  5. 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

    Google Scholar 

  6. 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))

    Google Scholar 

  7. 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)

    Google Scholar 

  8. D.E. Goldberg, Genetic algorithms in search, in Optimization and Machine Learning (Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA, 1989)

    Google Scholar 

  9. 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

    Google Scholar 

  10. 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

    Google Scholar 

  11. 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

    Google Scholar 

  12. U. Hacizade, I. Kaya, Ga based traveling salesman problem solution and its application to transport routes optimization. IFAC-PapersOnLine 51(30), 620–625 (2018)

    CrossRef  Google Scholar 

  13. 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)

    Google Scholar 

  14. 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

    Google Scholar 

  15. 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)

    MATH  Google Scholar 

  16. 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)

    Google Scholar 

  17. 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)

    CrossRef  Google Scholar 

  18. 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)

    CrossRef  Google Scholar 

  19. 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)

    CrossRef  Google Scholar 

  20. S. Mirjalili, Evolutionary multi-layer perceptron, in Evolutionary Algorithms and Neural Networks (Springer, Berlin, 2019), pp. 87–104

    Google Scholar 

  21. 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)

    Google Scholar 

  22. L.D. Whitley, T. Starkweather, D. Fuquay, Scheduling problems and traveling salesmen: the genetic edge recombination operator. ICGA 89, 133–40 (1989)

    Google Scholar 

  23. 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)

    Google Scholar 

  24. 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)

    MathSciNet  CrossRef  Google Scholar 

  25. G. Üçoluk, Genetic algorithm solution of the TSP avoiding special crossover and mutation. Intell. Autom. Soft Comput. 8(3), 265–272 (2002)

    CrossRef  Google Scholar 

Download references

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

  1. Cyber-Physical Systems Laboratory, Department of ICT and Natural Sciences, NTNU—Norwegian University of Science and Technology, Postboks 1517, NO-6025 Ålesund, Norway

    Robin T. Bye, Magnus Gribbestad, Ramesh Chandra & Ottar L. Osen

Authors
  1. Robin T. Bye
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Magnus Gribbestad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ramesh Chandra
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ottar L. Osen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robin T. Bye .

Editor information

Editors and Affiliations

  1. Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur, Rajasthan, India

    Dr. Manoj Kumar Sharma

  2. Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur, Rajasthan, India

    Prof. Vijaypal Singh Dhaka

  3. Department of Computer Science, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Serdang, Selangor, Malaysia

    Dr. Thinagaran Perumal

  4. Department of Information Technology, Techno India College of Technology, Kolkata, West Bengal, India

    Assist. Prof. Nilanjan Dey

  5. Faculdade de Engenharia da, Universidade do Porto, Porto, Portugal

    Dr. João Manuel R. S. Tavares

Rights and permissions

Reprints and Permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Verify currency and authenticity via CrossMark

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