BİL409-Decision Support System
Assignment-3
Your third assignment is to find a random tour (candidate solution) and
calculate this tour’s distance (objective function) for a traveling salesman
problem. The TSP asks: Given a collection of cities connected by highways, what
is the shortest route that visits every city and returns to the starting place.
You should write 4 Subs as Figure-1.
 You should generate a random permutation for tour.
 You should generate the distances between cities(distance matrix)
randomly. Distances between cities should between 5-100 km. The
distance between City 1 to City 1 is 0.The distances between cities should
be symmetric.
PS: You are not allowed to use worksheet functions and macro record options.
Your assignment due to 04/04/2016-23:59. The assignments that do not follow
these rules will be graded as “zero”. Follow these steps;
http://www.endustri.anadolu.edu.tr/DersDuyuru.aspx?dersId=78&duyuruId=1
374
Figure-1