| 求解TSP问题的一种启发式遗传算法 |
| |
| 引用本文： | 向万里,张静芳.求解TSP问题的一种启发式遗传算法[J].交通科技与经济,2010,12(2):36-38. |
| |
| 作者姓名： | 向万里 张静芳 |
| |
| 作者单位： | 兰州交通大学,交通运输学院,甘肃,兰州,730070 |
| |
| 摘 要： | TSP问题是著名的NPC问题，在组合优化中有许多应用。讨论如何应用启发式遗传算法求解此问题，并设计一种启发式交叉算子和换位变异算子，主要特点是给出算子在程序中的实现技巧，提高搜索的速度。经实例分析，算法性能较好，能较快得到问题的满意解。
|
| 关 键 词： | 旅行商问题 启发式算法 遗传算法 交叉算子 |
A Heuristic Genetic Algorithm for Solving Traveling Salesman Problem |
| |
| XIANG Wan-li,ZHANG Jing-fang.A Heuristic Genetic Algorithm for Solving Traveling Salesman Problem[J].Technology & Economy in Areas of Communications,2010,12(2):36-38. |
| |
| Authors: | XIANG Wan-li ZHANG Jing-fang |
| |
| Institution: | Scholl of Traffic & Transportation/a>;Lanzhou Jiaotong University/a>;Lanzhou 730070/a>;China |
| |
| Abstract: | Traveling Salesman Problem is a famous non-deterministic polynomial hard problem.And it has many applications in combinatorial optimization.In this paper,we discussed how to solve it by using heuristic genetic algorithm.Moreover,heuristic crossover operator and transposed mutation operator are designed and implementing technology of operators in programming is presented and it enhances searching speed of algorithm.Analysis of some instances shows that its performance is better,and satisfied solution is gott... |
| |
| Keywords: | Traveling Salesman Problem heuristic algorithm genetic algorithm crossover operator |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
