The Algorithm Animation of Genetic Algorithm of Travelling Salesman Problem

Abstract:

The traveling salesman problem is analyzed with genetic algorithms. The best route map and tendency of optimal grade of 500 cities before the first mutation, best route map after 15 times of mutation and tendency of optimal grade of the final mutation are displayed with algorithm animation. The optimal grade is about 0.0455266 for the best route map before the first mutation, but is raised to about 0.058241 for the 15 times of mutation. It shows that through the improvements of algorithms and coding methods, the efficiency to solve the traveling problem can be raised with genetic algorithms.

• Periodical: Applied Mechanics and Materials (Volumes 411-414)
• Pages: 2013-2016
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.411-414.2013
• Online since: September 2013
• Authors: Guo Zhi Wen
• Keywords: Algorithm Animation, Genetic Algorithm (GA), Mutation, Traveling Salesman Problem (TSP)

References

[1] David E. Goldberg: Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, 1989).

[2] Cheng-Fa Tsai, Chun-Wei Tsai and Tzer Yang: Systems, Man and Cybernetics, IEEE International Conference on, Oct. (2002).

DOI: 10.1109/icsmc.2002.1176016

[3] Carlos M. Fonseca and Peter J. Fleming: Proceedings of the Fifth International Conference (S. Forrest, ed. ), San Mateo, CA: Morgan Kaufmann, July (1993).

[4] John J. Grefenstette, Rajeev Gopal, Brian J. Rosmaita and Dirk Van Gucht: Proceedings of the 1st International Conference on Genetic Algorithms, (1985).

[5] Abdollah Homaifar, Shanguchuan guan and Gunar E: Liepins. Proceedings of the 5th International Conference on Genetic Algorithms, (1993).