Pointer Network Solution Pool : Combining Pointer Networks and Heuristics to Solve TSP Problems

This paper use pointer networks to improve the quality of initial solutions generation to solve slow convergence problems and the tendency to fall into local optimal solutions when solving path planning problems by the heuristic algorithm. The results show that the convergence speed and the optimisation outcome of the optimised algorithm are improved and can be effectively used to improve the application of heuristic algorithms such as VNS to the travelling salesman problem.