Geometrical Night

Genetic Algorithm solving the 'Travelling Salesperson Problem'

• Circular Route: A circular route allows easy visualization of a good solution.

• Log Population: Print population details to console. Disabling this improves performance. Console can be shown/hidden with the Escape key. 

• Seeded Population: Each member of the initial population is the best candidate chosen from a unique random population.

• Elitism: Retain the best performing candidate between populations.

• Memetic: Each candidate performs a local improvement search following distance measurement.

(Although there are better ways to solve the TSP problem, it does provide a nice visual representation of a genetic algorithm at work)

#### Some stats : ####

Given 75 locations, there exists 2 optimal routes within 330 Quattuortrigintillion possibilities. 1 Quattuortrigintillion is 10¹⁰⁵. If the observable universe were filled with sand, it would hold around 10⁹⁵ grains. (Carl Sagan (1981). Cosmos.)

##################