Software - Traveling Salesman Problem

The traveling salesman problem (from Mathworld) is a classic optimization problem in which one seeks to minimize the path taken by a salesman in traveling between N cities, where the salesman stops at each city one and only one time, never retracing his/her route.

Download the code here.

Browse the code here.