A book salesperson must call once a month on five customers located in cities 1 to...

  

Transcribed Image Text:

A book salesperson must call once a month on five customers located in cities 1 to 5. The salesperson has the liberty to begin his itinerary from any of the cities but must return to the starting city. The following table gives the distances in miles among the different cities. 1 HN 3 2 4 5 1 125 225 155 215 2 125 O 85 115 135 3 225 85 O 165 190 4 155 115 165 195 5 215 135 190 195 (a) Apply tabu (two-tenure periods) to this problem using the nearest- neighbor tour (Assuming the salesperson will start at city 5). (The Table format must be used to present your solution. Ensure the correct order of iterations is presented and terminate the tabu search if your solution does not improve after three (3) iterations excluding the starting tour) (b) Apply simulated annealing to the same problem using the nearest- neighbor tour (Assume the salesperson begins the itinerary from city 1. The Table format must be used to present your solution. (Tk = 0.5T k-1, To=80, the Temperature change is after two accept iterations). Ensure the correct order of iterations is presented and terminate the simulated annealing search after three (3) iterations excluding the starting tour) The following twelve (12) random numbers must be used sequentially until they are exhausted. If exhausted, then you begin from the first. Serial No 1 2 3 पं 5 6 Random Number 0.754 0.363 0.349 0.029 0.676 0.550 Serial Number 7 8 00 a 10 11 12 Random Number 0.376 0.667 0.362 0.195 0.498 0.812 A book salesperson must call once a month on five customers located in cities 1 to 5. The salesperson has the liberty to begin his itinerary from any of the cities but must return to the starting city. The following table gives the distances in miles among the different cities. 1 HN 3 2 4 5 1 125 225 155 215 2 125 O 85 115 135 3 225 85 O 165 190 4 155 115 165 195 5 215 135 190 195 (a) Apply tabu (two-tenure periods) to this problem using the nearest- neighbor tour (Assuming the salesperson will start at city 5). (The Table format must be used to present your solution. Ensure the correct order of iterations is presented and terminate the tabu search if your solution does not improve after three (3) iterations excluding the starting tour) (b) Apply simulated annealing to the same problem using the nearest- neighbor tour (Assume the salesperson begins the itinerary from city 1. The Table format must be used to present your solution. (Tk = 0.5T k-1, To=80, the Temperature change is after two accept iterations). Ensure the correct order of iterations is presented and terminate the simulated annealing search after three (3) iterations excluding the starting tour) The following twelve (12) random numbers must be used sequentially until they are exhausted. If exhausted, then you begin from the first. Serial No 1 2 3 पं 5 6 Random Number 0.754 0.363 0.349 0.029 0.676 0.550 Serial Number 7 8 00 a 10 11 12 Random Number 0.376 0.667 0.362 0.195 0.498 0.812