This repository contains an implementation of the simulated annealing optimization algorithm which is here used to solve the traveling salesman problem.
As the algorithm runs, it stores each step of the optimization process in a tour history, and once the algorithm has finished execution, it will animate these steps using SDL2.
- Build the project:
cabal build - Run the algorithm:
cabal run simulated-annealing
To run the test suite, run cabal new-test.
See LICENSE.