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
• المؤسسة: 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...