The neural network methods for solving Traveling Salesman Problem

Traveling Salesman Problem(TSP) is a main attention issue at present. Neural network can be used to solve combinatorial optimization problems. In recent years, there have existed many neural network methods for solving TSP, which has made a big step forward for solving combinatorial optimization problems. This paper reviews the neural network methods for solving TSP in recent years, including Hopfield neural network, graph neural network and neural network with reinforcement learning. Using neural network to solve TSP can effectively improve the accuracy of the approximate solution. Finally, we put forward the prospect of solving TSP in the future. (C) 2021 The Authors. Published by Elsevier B.V.