Efficient graph neural networks for travelling salesman problem using multilevel clustering

• Main Author: Dwivedee, Lakshyajeet
• Other Authors: Xavier Bresson
• Format: Final Year Project
• Language: English
• Published: Nanyang Technological University 2021
• Subjects: Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
• Online Access: https://hdl.handle.net/10356/148040
• Institution: Nanyang Technological University

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