| 一种新的混合遗传算法求解旅行商问题 |
| |
| 引用本文： | 胡志伟,郄培,赵新超,李显旭.一种新的混合遗传算法求解旅行商问题[J].计算机与现代化,2010(11):12-15. |
| |
| 作者姓名： | 胡志伟 郄培 赵新超 李显旭 |
| |
| 作者单位： | [1]北京邮电大学信息与通信工程学院,北京100876 [2]北京邮电大学计算机学院,北京100876 [3]北京邮电大学理学院数学系,北京100876 |
| |
| 基金项目： | 中央高校基本科研业务费资助项目 |
| |
| 摘 要： | 提出一种改进的混合遗传算法来求解TSP问题。在传统遗传算法基础上,杂交算子部分引入郭涛算法,使得算法保持较好的多样性和全局搜索能力,从而克服了传统遗传算法过早收敛的缺陷;变异算子引入粒子群算法,以加速算法收敛速度并提高求解精度,使其更快地找到最优解。通过TSPLIB大量经典实例验证,该算法均能快速找到比现有最优结果更好的解。
|
| 关 键 词： | 旅行商问题 遗传算法 郭涛算法 粒子群算法 |
A New Hybrid Genetic Algorithm for Traveling Salesman Problem |
| |
| HU Zhi-wei,QIE Pei,ZHAO Xin-chao,LI Xian-xu.A New Hybrid Genetic Algorithm for Traveling Salesman Problem[J].Computer and Modernization,2010(11):12-15. |
| |
| Authors: | HU Zhi-wei QIE Pei ZHAO Xin-chao LI Xian-xu |
| |
| Affiliation: | 1.School of Information and Telecommunication Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China;2.School of Computer,Beijing University of Posts and Telecommunications,Beijing 100876,China;3.Department of Mathematics,School of Science,Beijing University of Posts and Telecommunications,Beijing 100876,China) |
| |
| Abstract: | The paper presents an improved hybrid genetic algorithm to solve the Traveling Salesman Problem（TSP）.Based on the traditional genetic algorithm,Guo Tao algorithm is introduced to the crossover operation,which keeps good diversity and global search capability to overcome the shortcomings of premature convergence.PSO algorithm is introduced to the mutation operation,which accelerates the convergence rate,improves the solution quality,and finds the optimal solution more quickly.Verified by many examples from TSPLIB,the obtained results are better than the available optimal solutions,which demonstrate the efficiency and efficacy of the algorithm. |
| |
| Keywords: | traveling salesman problem genetic algorithm Guo Tao algorithm Particle Swarm Optimization |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
