Heuristics Visualised

Heuristic Optimisation algorithms are a common topic within the field of Computer Science. They are comprised of a variety of algorithms and frameworks which are designed to give an 'approximate' solution to a problem, and are employed when an exact solution is not necessary (although desirable).

This application aims to teach you about a variety of heuristic optimisation algorithms in a visual and interactive way.

Currently, the following algorithms/frameworks are covered:

- Nearest Neighbour
- Tabu Search
- Simulated Annealing
- Variable Neighbourhood Search
- Iterated Local Search
- Particle Swarm Optimisation
- Artificial Neural Networks

Note: This is a very early build, hence bugs and UI issues may be present. If you encounter any issues or have any suggested improvements, please let me know via email.