2. Consider the traveling salesman problem shown below, where city 1 is the home city. 8...

Transcribed Image Text:

2. Consider the traveling salesman problem shown below, where city 1 is the home city. 8 3 4 11 3 5 8 7 4 6 5 Starting with 1-2-4-3-5-1 as the initial trial solution, apply the basic tabu search algorithm by hand to this problem at least four iterations. 2. Consider the traveling salesman problem shown below, where city 1 is the home city. 8 3 4 11 3 5 8 7 4 6 5 Starting with 1-2-4-3-5-1 as the initial trial solution, apply the basic tabu search algorithm by hand to this problem at least four iterations.