| 多种群自适应模拟退火遗传算法求解TSP问题 |
| |
| 引用本文： | 夏仁强.多种群自适应模拟退火遗传算法求解TSP问题[J].毕节学院学报,2008,26(4). |
| |
| 作者姓名： | 夏仁强 |
| |
| 作者单位： | 毕节学院计算机科学系,贵州,毕节551700 |
| |
| 摘 要： | TSP问题是一个具有广泛应用背景和重要理论价值的组合优化NP难题。遗传算法是求解NP完全问题的一种方法。针对传统遗传算法求解TSP问题的不足，提出了一种多种群自适应模拟退火遗传算法，并给出了多种群分级、混合变异算子的设计。最后，对CHN31、ATT48和EIL51的TSP问题进行求解．仿真结果表明该改进遗传算法具有更好的收敛性，可以得到更好的最优解。
|
| 关 键 词： | 遗传算法 多种群 模拟退火 旅行商问题 |
The Solution of TSP Based on the Multiple Population Adaptive Simulated Annealing Genetic Algorithm |
| |
| XIA Ren-qiang.The Solution of TSP Based on the Multiple Population Adaptive Simulated Annealing Genetic Algorithm[J].Journal of Bijie University,2008,26(4). |
| |
| Authors: | XIA Ren-qiang |
| |
| Abstract: | TSP has the widespread application background and the important theory value in combination optimizes,which is a NP-complete problem,and the genetic algorithm is the method for solving NP-complete problem.In order to overcome the disadvantage of the traditional GA for solving the TSP problem,The paper proposes the multiple population Adaptive Simulated Annealing Genetic Algorithms,and designs multiple population grading and hybrid mutation operation.In the end,the experimental results of the CHN31 TSP,the ATT48 TSP and the EIL51 TSP on the improved genetic algorithm has a better convergence property and can induce better optimal results. |
| |
| Keywords: | Genetic Algorithm Multiple Population Simulated Annealing Traveling Salesman Problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
