CS6380: Artificial Intelligence
The Traveling salseman problem has been tackled by a genetic algorithm using nearest neighbour method. Children are made from the best performing routes, splicing is used to generate children. Finally, crisscross edges are removed using n-edges method.