My Honours Project for my Bachelor of Computer Science at Carleton University. This project explores a hierarchical approach to genetic algorithms applied to the classic Traveling Salesman Problem (TSP).
The algorithm uses a multi-level representation that evolves both the grouping of cities and the tour order within groups, allowing it to discover structure in the problem that flat representations miss.