How Genetic Algorithms and Evolutionary Computing Can Be Used to Find Near-Optimal Solutions for the Travelling Salesman Problem

Metaheuristics can find near-optimal solutions for NP-complete problems

Last year, I took the ‘Genetic Algorithms and Evolutionary Computing’ course at KU Leuven. The evaluation of the course is based entirely on a programming project in Python, where the task is to find near-optimal solutions for the travelling salesman problem. Conceptually, several matrices are given…