New Population initialization and sequential transformation methods of Genetic Algorithms for solving optimal TSP problem
Rae-Goo Kang, Hee-Kyoung Lim, Chai-Yeoung Jung · The Journal of the Korean Institute of Information and Communication Engineering · 2006
TSP(Traveling Salesman Problem) is a problem finding out the shortest distance out of many courses where given cities of the number of N, one starts a certain city and turns back to a starting city, visiting every city only once. As the number of cities having visited increases, the calculation rate increases geometrically. This problem makes TSP classified in NP-Hard Problem and genetic algorithm is used representatively. To obtain a better result in TSP, various operators have been developed and studied. This paper suggests new method of population initialization and of sequential transformation, and then proves the improvement of capability by comparing them with existing methods.