Repository of metaheuristic algorithms aimed to solve a Traveling Salesman Problem.
Part of the Metaheuristic Algorithms course I did in Wroclaw University of Science and Technology, 2023/2024.
lab1 | Intro - DFS cycle based on MST |
---|---|
lab2 | Local Search |
lab3 | Simulated Annealing, Tabu Search |
lab4 | Genetic algorithm |
Data for computation is taken from this website.
cd [lab_folder]
cmake -S . -B build && cmake --build build
./build/[lab_folder]
-
Raports:
-
Each lab, besides lab4, includes a Python script generating a graphical representation of a solution.
Sample: