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

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 a...

Full description

Bibliographic Details

Published in:	Engineering applications of artificial intelligence Vol. 97; p. 104061
Main Authors:	Hu, Yujiao, Zhang, Zhen, Yao, Yuan, Huyan, Xingpeng, Zhou, Xingshe, Lee, Wee Sun
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.01.2021
Subjects:	Combinatorial optimization problems Deep learning Graph neural network Planning Traveling salesman problem Deep learning Traveling salesman problem Combinatorial optimization problems Planning Graph neural network
ISSN:	0952-1976, 1873-6769
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!