# Question: Reconsider the example of a traveling salesman problem shown in

Reconsider the example of a traveling salesman problem shown in Fig. 14.4.

(a) When the sub-tour reversal algorithm was applied to this problem in Sec. 14.1, the first iteration resulted in a tie for which of two sub-tour reversals (reversing 3-4 or 4-5) provided the largest decrease in the distance of the tour, so the tie was broken arbitrarily in favor of the first reversal. Determine what would have happened if the second of these reversals (reversing 4-5) had been chosen instead.

(a) When the sub-tour reversal algorithm was applied to this problem in Sec. 14.1, the first iteration resulted in a tie for which of two sub-tour reversals (reversing 3-4 or 4-5) provided the largest decrease in the distance of the tour, so the tie was broken arbitrarily in favor of the first reversal. Determine what would have happened if the second of these reversals (reversing 4-5) had been chosen instead.

**View Solution:**## Answer to relevant Questions

Reconsider the traveling salesman problem shown in Prob. 14.1-1. (a) Perform the initialization step and the first iteration of the basic genetic algorithm presented in Sec. 14.4 by hand. Follow the instructions given at the ...Reconsider the traveling salesman problem shown in Prob. 14.1-1. Starting with 1-2-4-3-5-1 as the initial trial solution, apply the basic tabu search algorithm by hand to this problem. Consider the game having the following payoff table: Determine the optimal strategy for each player by successively eliminating dominated strategies. Give a list of the dominated strategies (and the corresponding dominating ...Consider the odds and evens game introduced in Sec. 15.1 and whose payoff table is shown in Table 15.1. (a) Use the approach described in Sec. 15.5 to formulate the problem of finding optimal mixed strategies according to ...Consider the linear programming model for player 1 given near the end of Sec. 15.5 for variation 3 of the political campaign problem (see Table 15.6). Verify the optimal mixed strategies for both players given in Sec. 15.5 ...Post your question