| 遗传算法求解TSP的进化策略 |
| |
| 引用本文： | 孙承意,余雪丽,王皖贞.遗传算法求解TSP的进化策略[J].太原科技大学学报,1996(2). |
| |
| 作者姓名： | 孙承意 余雪丽 王皖贞 |
| |
| 作者单位： | 太原工业大学，太原重型机械学院 |
| |
| 摘 要： | 本文提出用遗传算法（ＧＡ）求解旅行商问题（ＴＳＰ）的一整套进化策略，包括染色体的编码、反向运算、循环运算、交换运算．其中除反向运算外，均与通常的ＧＡ算法所采用的策略不同．文中解释了它们的几何意义．用该算法求解中国３１个城市的ＴＳＰ问题得到了１５４０４公里的新的路径长度．计算结果表明整个算法是有效的
|
| 关 键 词： | 优化 遗传算法 进化策略 旅行商问题 |
The Evolutionary Strategies for Solving TSP by Genetic Algorithm |
| |
| Sun Chengyi Yu Xueli,Wang Wanzhen.The Evolutionary Strategies for Solving TSP by Genetic Algorithm[J].Journal of Taiyuan University of Science and Technology,1996(2). |
| |
| Authors: | Sun Chengyi Yu Xueli Wang Wanzhen |
| |
| Abstract: | This paper proposed a full set of evolutionary strategies that include new method of encoding of chromosomes,invert,rotate and swap operations,for solving traveling salesman problem(TSP)by genetic algorithm(GA)The strategies are different from those commonly used in GA except the invert operation.The geometric meanings of the operations are explained in the paper Our algorithm have got new optimum length 15404 km of path that is the shortest path length we have seen,for solving TSP of 31 central cities of China.The result shows that our algorithm is efficient. |
| |
| Keywords: | optimization genetic algorithm evolutionary strategies traveling salesman problem(TSP) |
| 本文献已被 CNKI 等数据库收录！ |
