李飞, 白艳萍. A Genetic Algorithm for Traveling Salesman Problems[J]. 2007, (1): 49-52.DOI:
用遗传算法求解旅行商问题
摘要
论述了用遗传算法求解旅行商问题(TSP)的算法步骤
给出了在MATLAB环境下用遗传算法解决旅行商问题的具体程序设计.将此算法应用到6个旅行商问题中
并将得到的运行结果与用弹性网络得到的结果进行了比较
发现用遗传算法得到的结果与最优解较为接近.
Abstract
The procedure of solving Traveling Salesman Problem(TSP) by genetic algorithm was expounded.The detailed program solving TSP in MATLAB environment was presented.The algorithm was applied to six Traveling Salesman Problems.The results from genetic algorithm are rather conform to the optimal result
compared the results of genetic algorithm with the elastic net.
关键词
Keywords
references
Garey M,Johnson D.Computers and Intractability[M].Freeman W H,San Franciso,1979.
Johnson D S.Local optimization dan the traveling saleman problem.in M.S.Paterson(Editor)[C].Proceedings ofthe 17th Collouium on Automata,Languages,and Programming Springer-Verlag,Lecture Notes in Compter Sci-nence,1990,443:446-461.
米凯利维茨Z.演化程序遗传算法和数据编码的结合[M].北京:科学出版社,2000.
解可新,韩健,林友联.最优化方法[M].天津:天津大学出版社,1997.
Zhang Wendong,Bai Yanping.A hybrid elastic net method for solving the traveling salesman problem[J].Interna-tional of Software Engineering and Knowledge Engineering,2005,15(2):447-453.
白艳萍,胡红萍.一个改进的弹性网络算法求解TSP问题[J].华北工学院学报(自然科学版),2004(4):235-238.Bai Yanping,Hu Hongping.A modified elastic net algorithm for traveling salesman problem[J].Journal of NorthChina Institute of Technology,2004(4):235-238.(in Chinese)