摘要
分析了旅行商问题的时间复杂度特点,针对用遗传算法求解旅行商问题中存在的一些问题提出了改进算法,此算法将群体分为若干小子集,并用启发式交叉算子,以较好地利用父代个体的有效信息,达到快速收敛的效果.实验结果表明:此算法能提高寻优速度,解的质量也有所提高.
This paper analyzed the time complexity of traveling salesman problem, then put forward some improvement towards the genetic algorithm for solving this problem; dividing the population into some small subset and imposing heuristic crossover operator on the individual, which can inherit the good information of the parent individual well. So it can quickly get into convergence. The experimental result indicates the improved algorithm can accelerate the speed of finding solution and improve the precision.
出处
《中南民族大学学报（自然科学版）》
CAS
2006年第1期79-80,87,共3页
Journal of South-Central University for Nationalities：Natural Science Edition
基金
湖北省自然科学基金资助项目(2004ABA029)
关键词
旅行商问题
遗传算法
子集
启发式交叉算子
traveling salesman problem
genetic algorithm
subset
heuristic crossover operator
