A bidirectional graph neural network for traveling salesman problems on arbitrary symmetric graphs
Authors:
- Yujiao HuYHYujiao Hu
- Zhen ZhangZZZhen Zhang
- Yuan YaoYYYuan Yao
- Xingpeng HuyanXHXingpeng Huyan
- Xingshe ZhouXZXingshe Zhou
- Wee Sun LeeWLWee Sun Lee
- 1 January 2021
- journal article
- research article
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 97
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61751208, 61876151)
- Fundamental Research Funds for the Central Universities (3102017OQD097)
- National Research Foundation Singapore (AISG-RP-2018-006)
- China Scholarship Council
This publication has 11 references indexed in Scilit:
- An effective method for solving multiple travelling salesman problem based on NSGA-IISystems Science & Control Engineering, 2019
- Graph embedding techniques, applications, and performance: A surveyKnowledge-Based Systems, 2018
- Mastering the game of Go without human knowledgeNature, 2017
- The vehicle routing problem: State of the art classification and reviewComputers & Industrial Engineering, 2016
- The multiple traveling salesman problem: an overview of formulations and solution proceduresOmega, 2006
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Long Short-Term MemoryNeural Computation, 1997
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977