This project contains an implementation of the meteheuristic Iterated Local Search (ILS) algorithm to solve the NP-hard Traveling Salesman Problem using C++.
From the project folder, open your terminal and execute the following commands:
./tsp instances/<INSTANCE_NAME>
All the instances for testing are available in the instances folder under this project.