| 一种基于改进遗传算法的TSP问题求解方法 |
| |
| 引用本文： | 纪怀猛,蔡海滨.一种基于改进遗传算法的TSP问题求解方法[J].计算机与数字工程,2009,37(4):10-12. |
| |
| 作者姓名： | 纪怀猛 蔡海滨 |
| |
| 作者单位： | 仰恩大学计算机与信息学院,泉州,362014 |
| |
| 摘 要： | 通过改进经典遗传算法的交叉算子和变异算子，提出了一种改进遗传算法。介绍了该算法的基本步骤及特点，并对TSP问题进行了仿真实验。实验结果表明改进算法有效地提高了算法的收敛速度与寻优质量，在解决TSP问题时表现出良好特性，与经典遗传算法相比具有明显优势。
|
| 关 键 词： | 旅行商问题 遗传算法 顺序交叉 |
A Novel Genetic Algorithm for Traveling Salesman Problem |
| |
| Ji Huaimeng,Cai Haibin.A Novel Genetic Algorithm for Traveling Salesman Problem[J].Computer and Digital Engineering,2009,37(4):10-12. |
| |
| Authors: | Ji Huaimeng Cai Haibin |
| |
| Affiliation: | Computer & Information College;Yang-en University;Quanzhou 362014 |
| |
| Abstract: | A novel genetic algorithm is proposed,by modifying the crossover operator and mutation operator of classic genetic algorithm.It introduces basic approaches and characteristics of the algorithm.The new one is simulated with Traveling Salesman Problem.The simulation results show that the novel algorithm effectively improve the convergence of algorithm optimizing speed and quality.It shows good characteristics in resolving the TSP issue,has obvious advantages and compared with simple genetic algorithm. |
| |
| Keywords: | TSP genetic algorithm order crossover |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
