| 基于遗传算法求解TSP问题的一种算法 |
| |
| 引用本文： | 敖友云,迟洪钦.基于遗传算法求解TSP问题的一种算法[J].计算机与数字工程,2006,34(4):52-55. |
| |
| 作者姓名： | 敖友云 迟洪钦 |
| |
| 作者单位： | 上海师范大学数理学院,上海,200234 |
| |
| 摘 要： | TSP问题是一个经典的NP难度的组合优化问题，遗传算法是求解TSP问题的有效方法之一。利用交换启发交叉算子实现局部搜索加快算法的收敛速度和利用变换变异算子维持群体的多样性防止算法早熟收敛，给出了一种求解TSP问题的遗传算法。仿真实验结果表明了该算法的有效性和可行性。
|
| 关 键 词： | 旅行商问题 遗传算法 组合优化 |
| 修稿时间： | 2005年7月11日 |
A Method Based on Genetic Algorithm for Solving TSP |
| |
| Ao Youyun,Chi Hongqin.A Method Based on Genetic Algorithm for Solving TSP[J].Computer and Digital Engineering,2006,34(4):52-55. |
| |
| Authors: | Ao Youyun Chi Hongqin |
| |
| Abstract: | TSP(Traveling Salesman Problem)is a typical NP-hard problem in combinatorial optimization and Genetic Algorithm is one of methods for solving TSP.By employing exchange heuristic crossover and exchange mutation operators,a new method based genetic algorithm for solving TSP is presented.The experimental results simulated on several TSPs show that this algorithm is effective and feasible to solve TSP. |
| |
| Keywords: | traveling salesman problem(TSP) genetic algorithm combinatorial optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
