摘要
针对以往各种遗传算法解决旅行商问题(TSP)经常面临过早收敛问题,提出了一种改进的遗传算法,使得改进后的算法可以有效保持种群多样性,从而提高了算法的稳定性和准确性。应用于解决TSP问题,并通过编程测试将改进后的遗传算法和经典遗传算法作了对比。
An improved genetic algorithm is applied in traveling salesman problem in order to avoid some problems, such as the premature convergence and so on. The improved genetic algorithm is proposed to avoid such phenomenon and advance stability and veracity of the algorithm. The implementation of the genetic algorithm is described, and results are presented.
出处
《电脑开发与应用》
2009年第1期35-36,共2页
Computer Development & Applications
关键词
改进遗传算法
旅行商问题
自适应变异
improved genetic algorithm, traveling salesman problem, mutation probability
