A bidirectional graph neural network for traveling salesman problems on arbitrary symmetric graphs

• DOI: 10.1016/j.engappai.2020.104061
• Publication Date: 2020-11-10T11:33:23Z
• Authors: Yujiao Hu; Zhen Zhang; Yuan Yao; Xingpeng Huyan; Xingshe Zhou; Wee Sun Lee
• Keywords: 000; traveling salesman problem; deep learning; graph neural network; 511; Deep learning; 02 engineering and technology; combinatorial optimization problems; Graph neural network; 004; Traveling salesman problem; Planning; Combinatorial optimization problems; 0202 electrical engineering, electronic engineering, information engineering; planning

Abstract Deep learning has recently been shown to provide great achievement to the traveling salesman problem (TSP) on the Euclidean graphs. These methods usually fully represent the graph by a set of coordinates, and then captures graph information from the coordinates to generate the solution. The TSP on arbitrary symmetric graphs models more realistic applications where the working graphs maybe sparse, or the distance between points on the graphs may not satisfy the triangle inequality. When prior learning-based methods being applied to the TSP on arbitrary symmetric graphs, they are not capable to capture graph features that are beneficial to produce near-optimal solutions. Moreover, they suffer from serious exploration problems. This paper proposes a bidirectional graph neural network (BGNN) for the arbitrary symmetric TSP. The network learns to produce the next city to visit sequentially by imitation learning. The bidirectional message passing layer is designed as the most important component of BGNN. It is able to encode graphs based on edges and partial solutions. By this way, the proposed approach is much possible to construct near-optimal solutions for the TSP on arbitrary symmetric graphs, and it is able to be combined with informed search to further improve performance.