基于Transformer的旅行商问题解法  

作　　者：陆丽丹 曹陆铖 

机构地区：[1]江苏联合职业技术学院,江苏常熟215500 [2]重庆大学数学与统计学院,重庆400044

出　　处：《科技创新与应用》2024年第29期161-165,共5页Technology Innovation and Application

摘　　要：在针对旅行商问题(Travelling Salesman Problem)的近似求解算法中,传统启发式算法收敛速度较慢,准确性较低。为解决上述问题,该文提出一种基于Transformer的神经网络方法。该方法使用神经网络,可有效提高近似解的求解速度和准确性,并使用Transformer注意力机制全面提高神经网络的性能。该方法使用强化学习进行训练,使用束搜索算法进行搜索。使用该方法对随机50节点的旅行商问题进行测试,试验结果表明该种基于Transformer的旅行商问题解法,可在较低的复杂度前提下,得到近似于精确解的效果。In approximate solutions to the traveling salesman problem(TSP),traditional heuristic algorithms are known for their slow convergence speed and low accuracy.To address these issues,this paper proposes a neural network approach based on Transformers.This method utilizes neural networks to effectively improve the speed and accuracy of approximate solutions,while leveraging the Transformer's attention mechanism to enhance the overall performance of the neural network.This method uses reinforcement learning for training and beam search algorithm for search.This method is used to test the random 50-node traveling salesman problem,and the experimental results show that the solution of the traveling salesman problem based on Transformer can get the effect which is similar to the exact solution under the premise of low complexity.

关 键 词：旅行商问题 TRANSFORMER 注意力机制 神经网络 近似求解 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]