PLEASE SOLVE THIS QUESTION PLEASE SOLVE THIS QUESTION PLEASE SOLVE THIS QUESTION VPLEASE SOLVE THIS QUESTION PLEASE SOLVE THIS QUESTION PLEASE SOLVE THIS QUESTION

(25 points) Apply the tabu search algorithm (Algorithm 15C) on page 895 in Chapter 15 to a TSP with 5 cities. Generate your own distance matrix randomly :-use integers, in Excel (see the randbetween(Let your first solution be the one found by using the nearest neigbor algorithm. Let tmax be 5. Once an interchange occurs, put the smaller indexed position on the tabu list for 2 iterations. Give your results as a table like in the book. Also make sure to provide your distance matrix, and your net changes for all of the possible interchanges during each iteration. You may solve this question in Excel for convenience. Note that the total distance includes the return trip to your starting point in the TSP. ALGORITHM 15C: TABU SEARCH = Step 0: Initialization. Choose any starting feasible solution x(0) and an iteration limit tmax. Then set incumbent solution x() and solution index 0 te 0. No moves are tabu. Step 1: Stopping. If no non-tabu move Axlin move set Mleads to a feasible neighbor of current solution x(t), or if t = t max, then stop. Incumbent solu- tion is an approximate optimum. Step 2: Move. Choose some non-tabu feasible move AX E Mas Ax(t+1). Step 3: Step. Update x(t+1) + X(t) + A x(t+1) Ex Step 4: Incumbent Solution. If the objective function value of x(t+1) is superior to that of incumbent solution , replace x(t+1). Step 5: Tabu List. Remove from the list of tabu of forbidden moves any that have been on it for a sufficient number of iterations, and add a collection of moves that includes any returning immediately from x(t+1) Step 6: Increment. Increment tot + 1, and return to Step 1. to x(t)