Efficient graph neural networks for travelling salesman problem using multilevel clustering

• 主要作者: Dwivedee, Lakshyajeet
• 其他作者: Xavier Bresson
• 格式: Final Year Project
• 語言: English
• 出版: Nanyang Technological University 2021
• 主題: Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
• 在線閱讀: https://hdl.handle.net/10356/148040

The goal of the Travelling Salesman Problem is to find the shortest route that visits each city exactly once and returns to the origin, given a list of cities and the distances between each pair of cities. Such combinatorial optimization problems are difficult to solve efficiently given large proble...