This project aims to solve the Travelling Salesman Problem (TSP) using two heuristic approaches: Genetic Algorithm (GA) and Simulated Annealing (SA). The ATT48 dataset is used as a benchmark to compare their efficiency in finding the shortest possible route while visiting all cities exactly once.
genetic-algorithm simulated-annealing nphard optimisation metaheuristic travelling-salesman-problem graphtheory algorithmdesign
-
Updated
Feb 13, 2026 - Python