TSP( 9cities)with SA
2016-08-23
0 0 0
no vote
Other
Earn points
In this homework, make up a Travel SalesmanProblem (TSP): find the optimal tour which starts from city 1, visits each cityonce, and returns to city 1 with the shortest distance. The distance matrix iscomposed of random integer values between 50 and 99. This problem is symmetricso the distance from city i to city j is the same as that from city j and cityi.
You will be assigned to SA inthe following pages. Develop a SA algorithm to find the optimal tour; extrabonus will be given if you can do both.
Your report should include the followingitems
l Distance matrix of the problem
l
c#
SA
Related Source Codes
No. 186: DX0110- Source code for community propert
0
0
no vote
No. 219: DX0149- Source code for community propert
0
0
no vote
Verification code identification
0
0
no vote
CSV data analysis tool
0
0
no vote
Source code of hospital medical record information
0
0
no vote
No comment