Using the basic Tabu Search method problem shown below. - solve the Traveling Salesman Problem, for...

 

Transcribed Image Text:

Using the basic Tabu Search method problem shown below. - solve the Traveling Salesman Problem, for the Use the initial solution to be: 1-2-3-4-5-1 Perform only three iterations of the algorithm (using the spreadsheet template) For iteration 1, only consider 1-link sub-tour reversals. For iterations 2 and 3, consider both 1 and 2 link sub-tour reversals. # 6) A с 1 Traveling Salesman Problem 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 1 B 2 Iter Subtour Rev Current Solution Cost Sel Tabu List * 0 34 3 DE 1-2-3-4-5-1 F GHỊ J K 1 L M N O P 1-2 1-3 1-4 1->5 2-1 2->3 2->4 2->5 3-1 3->2 3-4 3->5 4->1 4->2 4-3 4->5 8 4 8 11 8 5 6 3 4 5 4 7 8 6 4 6 Q R S T U V W 1 1 1 X Y Z AA AB 5->1 5->2 5->3 5->4 11 3 7 6 1 Check 5 Using the basic Tabu Search method problem shown below. - solve the Traveling Salesman Problem, for the Use the initial solution to be: 1-2-3-4-5-1 Perform only three iterations of the algorithm (using the spreadsheet template) For iteration 1, only consider 1-link sub-tour reversals. For iterations 2 and 3, consider both 1 and 2 link sub-tour reversals. # 6) A с 1 Traveling Salesman Problem 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 1 B 2 Iter Subtour Rev Current Solution Cost Sel Tabu List * 0 34 3 DE 1-2-3-4-5-1 F GHỊ J K 1 L M N O P 1-2 1-3 1-4 1->5 2-1 2->3 2->4 2->5 3-1 3->2 3-4 3->5 4->1 4->2 4-3 4->5 8 4 8 11 8 5 6 3 4 5 4 7 8 6 4 6 Q R S T U V W 1 1 1 X Y Z AA AB 5->1 5->2 5->3 5->4 11 3 7 6 1 Check 5

Answer rating: 100% (QA)

SOLUTION To solve the Traveling Salesman Problem using the basic Tabu Search method we will perform three iterations of the algorithm In the first iteration we will only consider 1link subtour reversa... View the full answer