| 基于TSP问题的混合遗传算法研究 |
| |
| 引用本文： | 余意,陈宇拓,李键红.基于TSP问题的混合遗传算法研究[J].信息安全与通信保密,2009(5):101-103. |
| |
| 作者姓名： | 余意 陈宇拓 李键红 |
| |
| 作者单位： | 长沙市中南林业科技大学计算机科学学院,湖南,长沙,410004 |
| |
| 摘 要： | 文章在介绍遗传算法和混合遗传算法思想的理论基础上，分析了遗传算法的主要优缺点和改进算法的有效性原则，利用模拟退火算法的局部寻优能力提出了一种改进的遗传模拟退火算法。结合两者的优点，对其中的选择、交叉和变异操作进行了改进，并将其运用到TSP问题的求解之中。同时，给出了算法的具体实现过程，并进行了仿真实验，证明了混合算法的有效性。
|
| 关 键 词： | 旅行商问题 模拟退火算法 遗传算法 |
Research on Mixed Genetic Algorithms Based On Traveling Salesman Problem |
| |
| YU Yi,CHEN Yu-tuo,LI Jian-hong.Research on Mixed Genetic Algorithms Based On Traveling Salesman Problem[J].China Information Security,2009(5):101-103. |
| |
| Authors: | YU Yi CHEN Yu-tuo LI Jian-hong |
| |
| Affiliation: | (Department of Computer Science, Central South Forest University Of Technology, Changsha Hunan 410004, China) |
| |
| Abstract: | Based on the theory of genetic algorithm and missed genetic algorithms, the paper analyzes the major merits and shortcomings of the genetic algorithms. It presents an mixed genetic simulated annealing algorithm aimed at traveling salesman problem, which combines the merits of the genetic algorithms and simulated annealing algorithm and improves the operation of choice, crossover and mutation. This paper gives the implementation of the algorithm for traveling salesman problem, and the simulation results have proved its efficiency. |
| |
| Keywords: | traveling salesman problem simulated annealing algorithm genetic algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
