Approximate, Greedy, and 1-Tree Tours for the Traveling Salesman Problem

This application finds eight approximate and eight greedy tours for an instance of the traveling salesman problem with eight cities. This is a small problem and the search space is (n-1)!/2=7!/2=2,520 different tours, one or some of which are optimal.

C# (95.9 KB)
 
 
 
 
 
(0)
199 times
Add to favorites
9/6/2015
E-mail Twitter del.icio.us Digg Facebook