AN IMPROVED GENETIC ALGORITHM FOR TSP

摘要：

In this paper, an improved Genetic Algorithm is proposed to solve Traveling Salesman Problem (TSP).In order to improve the performance of Genetic Algorithm, untwist operator is introduced.The untwist operator can untie the knots of route effectively, so it can shorten the length of route and quicken the convergent speed.The computation with experimental data shows the untwist operator and the solving method are effective.

关键词： Genetic algorithm Traveling salesman problem (TSP) Untwist operator

作者: LI-YING WANG JIE ZHANG HUA LI

作者单位: Department of Mathematics and Physics, Shijiazhuang Railway Institute, Shijiazhuang 050043,China The 54th Institute of CETC, Shijiazhuang 050081, China

会议类型: 国际会议

会议名称: 2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

会议地点: 香港

会议语种:英文

页码: 925-928

在线出版日期: 2007-08-19（万方平台首次上网日期，不代表论文的发表时间）