| 指针网络改进遗传算法求解旅行商问题 |
| |
| 引用本文： | 沈涤. 指针网络改进遗传算法求解旅行商问题[J]. 计算机应用文摘, 2022, 0(1) |
| |
| 作者姓名： | 沈涤 |
| |
| 作者单位： | 上海师范大学信息与机电工程学院 |
| |
| 摘 要： | 虽然遗传算法相较于其他算法能够更好地求解旅行商问题,但这种算法在使用的过程中容易陷入局部最优的问题,进而导致问题求解遭遇困境。文章在简要介绍旅行商问题的基础上,介绍了遗传算法求解旅行商问题的思路和方法,并明确算法应用中存在的不足。在此基础上提出基于指针网络改进遗传算法求解旅行商问题的新思路,为弥补遗传算法的缺陷提供相应的原理支持。
|
| 关 键 词： | 指针网络 遗传算法 旅行商问题 |
Pointer network improved genetic algorithm for solving traveling salesman problem |
| |
| SHEN Di. Pointer network improved genetic algorithm for solving traveling salesman problem[J]. Chinese Journal of Computer Application, 2022, 0(1) |
| |
| Authors: | SHEN Di |
| |
| Affiliation: | (School of information and electromechanical engineering,Shanghai Normal University,Shanghai 200234,China) |
| |
| Abstract: | Although genetic algorithm can solve the traveling salesman problem better than other algorithms,this algorithm is easy to fall into the problem of local optimization,which leads to the difficulty of problem solving.Based on the brief introduction of the traveling salesman problem,this paper introduces the ideas and methods of genetic algorithm to solve the traveling salesman problem,and defines the shortcomings in the application of the algorithm.On this basis,a new idea of improving the genetic algorithm to solve the traveling salesman problem based on pointer network is proposed,which provides corresponding principle support for making up the defects of genetic algorithm. |
| |
| Keywords: | pointer network genetic algorithm traveling salesman problem |
| 本文献已被 维普 等数据库收录！ |
|
