| 基于自适应选择算子遗传算法的TSP问题优化 |
| |
| 引用本文： | 李绍中.基于自适应选择算子遗传算法的TSP问题优化[J].韶关学院学报,2009,30(12):11-16. |
| |
| 作者姓名： | 李绍中 |
| |
| 作者单位： | 中山大学软件学院,广东广州,510275;番禺职业技术学院软件学院,广东广州,511483 |
| |
| 摘 要： | 轮盘选择方式往往能保证算法的全局收敛性，但收敛速度较慢，而锦标赛选择方式收敛速度优于轮盘选择方式，但不能保证算法的全局收敛性．选用轮盘选择和锦标赛选择相结合自适应选择算子的遗传算法。并优化TSP问题求解，则可以调整收敛速度，避免被动式搜索．
|
| 关 键 词： | 优化 遗传算法 TSP 选择算子 |
Optimization for TSP problem based on genetic algorithm of adaptive selection operator |
| |
| LI Shao-zhong.Optimization for TSP problem based on genetic algorithm of adaptive selection operator[J].Journal of Shaoguan University(Social Science Edition),2009,30(12):11-16. |
| |
| Authors: | LI Shao-zhong |
| |
| Institution: | LI Shao-zhong(1.School of Software, Sun Yat-sen University,Guangzhou 501275, Guangdong, China; 2. School of Software, Panyu Polytechnic University, Guangzhou 511483, Guangdong, China) |
| |
| Abstract: | Although roulette wheel selection guarantees global convergence of an algorithm, its speed is quite slow. On the other hand, tournament selection converges very fast. But it cannot ensure global convergence of the algorithm. To overcome the problem, in this paper, we optimize the solution of the TSP problem by using an adaptive operator selection method, which combines the roulette wheel selection. |
| |
| Keywords: | TSP |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
