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

Celý popis

Podrobná bibliografie

Vydáno v:	Engineering applications of artificial intelligence Ročník 97; s. 104061
Hlavní autoři:	Hu, Yujiao, Zhang, Zhen, Yao, Yuan, Huyan, Xingpeng, Zhou, Xingshe, Lee, Wee Sun
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.01.2021
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!