| 一种基于近邻策略求TSP问题的改进演化算法 |
| |
| 引用本文： | 何健,张宏军,王之腾,高宁,邢英.一种基于近邻策略求TSP问题的改进演化算法[J].计算机与现代化,2012(8):1-5. |
| |
| 作者姓名： | 何健 张宏军 王之腾 高宁 邢英 |
| |
| 作者单位： | 解放军理工大学工程兵工程学院,江苏南京,210007 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 针对贪心演化算法(GEA)在旅行商问题中存在的求解规模小、成功率低的缺点,引入Inver-over倒异算子、贪心算子,改进近邻优化、映射算子、变异算子等策略,提出一种新的改进演化算法来求解中等规模旅行商问题(TSP)。通过仿真实验,验证了该进化算法收敛速度快、求解成功率高的优点,稳定性也更好。
|
| 关 键 词： | 旅行商问题 演化算法 近邻优化 贪心算子 映射算子 |
An Improved Evolutionary Algorithm for TSP Based on Nearest Neighbor Strategy |
| |
| HE Jian
,
ZHANG Hong-jun
,
WANG Zhi-teng
,
GAO Ning
,
XING Ying.An Improved Evolutionary Algorithm for TSP Based on Nearest Neighbor Strategy[J].Computer and Modernization,2012(8):1-5. |
| |
| Authors: | HE Jian ZHANG Hong-jun WANG Zhi-teng GAO Ning XING Ying |
| |
| Affiliation: | (Engineering Institute of Engineering Corps,PLA Univ.of Sci.& Tech.,Nanjing 210007,China) |
| |
| Abstract: | For the shortcomings of greed evolutionary algorithm(GEA) in solving the traveling salesman problem,such as small-scale,low success rate,this paper induces Inver-over down different operators,and greedy operators,improves close neighbor optimization,mapping operator,mutation operator strategy,proposes a new and improved evolutionary algorithm to solve the medium-scale traveling salesman problem(TSP).Simulation results verify that the evolutionary algorithm converges fast,and is of the advantages of a high success rate,better stability. |
| |
| Keywords: | traveling salesman problem evolutionary algorithm close neighbors optimization greedy operator mapping operator |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
