GAVis

Genetic Algorithm Visualisation for beginners to learn GA.

Aim of the project is to visualise GA solving the following three problems:

1. Traveling Salesman Problem: shortest possible route that visits each city exactly once and returns to the origin city using randomly generated cities
2. Diophantine Equation Problem: Trying to solve ax + by + .... + mz = n equation, where a, b, …, m and n are randomly chosen integers.
3. Finance Problem: Not completed!

History

This source code originally was a part of a Bachelor thesis (2009), but updated considerably in 2017.