计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (33): 45-47.DOI: 10.3778/j.issn.1002-8331.2009.33.015

• 研究、探讨 • 上一篇    下一篇

改进遗传算法在求解TSP问题上的应用研究

陶利民1,郭俊恩2   

  1. 1.杭州师范大学 信息科学与工程学院,杭州 310036
    2.洛阳理工学院 计算机与信息工程系,河南 洛阳 471023
  • 收稿日期:2008-10-28 修回日期:2009-01-16 出版日期:2009-11-21 发布日期:2009-11-21
  • 通讯作者: 陶利民

Application of solving TSP based on improved genetic algorithm

TAO Li-min1,GUO Jun-en2   

  1. 1.School of Information Science and Engineering,Hangzhou Normal University,Hangzhou 310036,China
    2.Department of Computer and Information Engineering,Luoyang Institute of Science and Technology,Luoyang,Henan 471023,China
  • Received:2008-10-28 Revised:2009-01-16 Online:2009-11-21 Published:2009-11-21
  • Contact: TAO Li-min

摘要: 遗传算法是一种比较成熟的智能算法,一般通过改进遗传算法的算子达到提高算法性能的目的。提出一种改进的遗传算法,遗传算子是基于近邻选择策略设计的,另外还对评估函数、种群多样性以及保留精英算子等方面对遗传算法进行了改进,并将其应用到旅行商问题的求解上,实验结果表明提出的算法是有效的。

关键词: 遗传算法, 智能算法, 近邻选择策略, 遗传算子, 旅行商问题

Abstract: Genetic algorithm is a kind of more mature intelligent algorithm,which is generally improved by enhancing the operator of genetic algorithm.The paper proposes an improved genetic algorithm.Its genetic operator is designed based on neighbor choosing strategy.Besides,the genetic algorithm is improved in the evaluation function,variety of populations,saving the elite operator etc.And then it is applied to traveling salesman problem.The experiment result indicates that the improved genetic algorithm is effective.

Key words: genetic algorithm, intelligent algorithm, neighbor choosing strategy, genetic operator, traveling salesman problem

中图分类号: