Genetic Algorithm for the Traveling Salesman Problem

This application attempts to find optimal solutions to the classic traveling salesman problem which is known to be NP-hard. The algorithm utilized is a simple genetic algorithm that uses crossover and mutation. Partially mapped crossover is used with a simple swap mutation op.

C# (191.7 KB)
1,507 times
Add to favorites
E-mail Twitter Digg Facebook

Solution explorer

Click an item in the panel on the left to view the contents here.