Simulated Annealing for the Traveling Salesman Problem

This application attempts to find an optimal solution to the traveling salesman problem. The traveling salesman problem involves finding the minimum round-trip tour of n cities where the starting city is also the ending city. This problem is known to be NP-hard.

C# (175.4 KB)
 
 
 
 
 
5 Star
(1)
576 times
Add to favorites
9/14/2015
E-mail Twitter del.icio.us Digg Facebook

Solution explorer

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