Just some notebooks I wrote to research some fun stuff in hobby time

Notebook for demonstrating simulated annealing

Computational Intelligence algorithm resources. Programming Language: Python 3.7 | IDE: Jupyter Notebook

Jupyter notebook to solve the Traveling Salesman Problem (TSP) between US state capitals ✈️

Notebooks created for a college assignment where simulated annealing was used to solve the travelling salesman problem.

Jupyter notebooks, scripts, and results associated with the paper Visualization of Optimization Algorithms by Marco Morais (Morais, 2020).

The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" In this notebook, I demonstate the solution of this problem with the simulated annealing algorithm.