Abstract
This paper focuses on improving the efficiency of the genetic algorithm, analysis the shortages of the algorithm at coding method and mutation operator and selected a TSP problem to simulate. First of all, the initial population was taken by order coding to speed up the algorithm convergence. In addition, the inversion operation and migration operation had been added into the mutation process. The experimental results show that without sacrificing convergence speed and the scale of population the improved algorithm has an extraordinary increase on optimal solutions and efficiency.
Publisher
Trans Tech Publications, Ltd.
Reference10 articles.
1. Xu Z B, Chen Z P, Zhang X S. Theoretical development on genetic algorithms: a review [J]. Advances in Mathematics, 2000, 29(2): 97-114.
2. Armon A, Avidor A, Schwartz O. Cooperative TSP [M]. Algorithms–ESA 2006. Springer Berlin Heidelberg, 2006: 40-51.
3. Merz P, Freisleben B. Genetic local search for the TSP: New results [C]. Evolutionary Computation, 1997., IEEE International Conference on. IEEE, 1997: 159-164.
4. Tsai H K, Yang J M, Tsai Y F, et al. An evolutionary algorithm for large traveling salesman problems [J]. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, 2004, 34(4): 1718-1729.
5. Beasley D, Martin R R, Bull D R. An overview of genetic algorithms: Part 1. Fundamentals [J]. University computing, 1993, 15: 58-58.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献