An Optimized Genetic Algorithm for TSP

摘要：

It is difficult to find out a precise answer to TSP (Traveling Salesman Problem).But GA (Genetic Algorithm) can find a better answer to it.This paper introduce GA and its essence.Then TSP,which is based on GA,is presented.In this paper main operators in GA,such as crossover operators and mutation operators,are analyzed and compared.By employing heuristic crossover and inversion mutation,a new method based on genetic algorithm for solving TSP is presented.The experimental results simulated on TSP show that this algorithm is feasible and effective to solve TSP.Employing heuristic crossover and inversion mutation can prevent premature convergence and ensure that the population is diverse,like what happens in the nature.

关键词： Genetic Algorithm Selection Crossover Mutation TSP

作者: Dongling Bai Qingping Guo

作者单位: Department of Computer Science and Technology,Wuhan University of Technology Wuhan,Hubei 430063.P.R.China

会议类型: 国际会议

会议名称: 2008年国际电子商务、工程及科学领域的分布式计算和应用学术研讨会(2008 International Symposium on Distributed Computing and Applications for Business Engineering and Science)

会议地点: 大连

会议语种:英文

页码: 667-671

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