A Jupyter notebook solving the Traveling Salesperson Problem with the use of genetic algorithms.
In this exercise, I will attempt to solve an instance of the traveling salesman problem (TSP) using different methods.
The goal is to become familiar with evolutionary algorithms
and compare their effectiveness with exhaustive search on a difficult search problem without the use of EA-related libraries.
To run this notebook
- Download european_cities.csv and keep it in the same folder as the notebook
- Run the imports
- Run everything else