# Question: Reconsider the traveling salesman problem shown in Prob 14 1 1 a Perform

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 beginning of the Problems section to obtain the needed random numbers. Show your work, including the use of the random numbers.

(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 beginning of the Problems section to obtain the needed random numbers. Show your work, including the use of the random numbers.

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

Use your IOR Tutorial to apply the basic algorithm for all three metaheuristics presented in this chapter to the traveling salesman problem described in Prob. 14.2-6. (Use 1-2-3-4-5-6-7- 8-1 as the initial trial solution for ...Consider the 8-city traveling salesman problem whose links have the associated distances shown in the following table (where a dash indicates the absence of a link). Consider the odds and evens game introduced in Sec. 15.1 and whose payoff table is shown in Table 15.1. (a) Show that this game does not have a saddle point. (b) Write an expression for the expected payoff for player 1 (the ...Two manufacturers currently are competing for sales in two different but equally profitable product lines. In both cases the sales volume for manufacturer 2 is three times as large as that for manufacturer 1. Because of a ...Consider the general m × n, two-person, zero-sum game. Let pij denote the payoff to player 1 if he plays his strategy i (i = 1, . . . , m) and player 2 plays her strategy j ( j = 1, . . . , n). Strategy 1 (say) for player 1 ...Post your question