New and Improved Genetic Algorithm for the Traveling Salesman Problem

This application is the best evolutionary program for traveling salesman problem that I have ever posted to the Internet. The algorithm uses partially mapped crossover and two different mutation operators. The mutation operators are reciprocal swap and inversion.

C# (361.4 KB)
192 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.