# Question: Consider an 8 city traveling salesman problem cities 1 2

Consider an 8-city traveling salesman problem (cities 1, 2, . . . , 8) where city 1 is the home city and links exist between all pairs of cities. For each of the following pairs of parents, generate their two children when applying the basic genetic algorithm presented in Sec. 14.4. (Follow the instructions given at the beginning of the Problems section to obtain the needed random numbers, and then show your use of these random numbers.)

(a) The parents are 1-2-3-4-7-6-5-8-1 and 1-5-3-6-7-8-2-4-1.

(b) The parents are 1-6-4-7-3-8-2-5-1 and 1-2-5-3-6-8-4-7-1.

(c) The parents are 1-5-7-4-6-2-3-8-1 and 1-3-7-2-5-6-8-4-1.

(a) The parents are 1-2-3-4-7-6-5-8-1 and 1-5-3-6-7-8-2-4-1.

(b) The parents are 1-6-4-7-3-8-2-5-1 and 1-2-5-3-6-8-4-7-1.

(c) The parents are 1-5-7-4-6-2-3-8-1 and 1-3-7-2-5-6-8-4-1.

## Answer to relevant Questions

Reconsider the nonconvex programming problem shown in Prob. 14.3-7. Suppose now that the variable x is restricted to be an integer. (a) Perform the initialization step and the first iteration of the basic genetic algorithm ...Consider the traveling salesman problem shown below, where city 1 is the home city. The labor union and management of a particular company have been negotiating a new labor contract. However, negotiations have now come to an impasse, with management making a “final” offer of a wage increase of $1.10 per ...For the game having the following payoff table, use the graphical procedure described in Sec. 15.4 to determine the value of the game and the optimal mixed strategy for each player according to the minimax criterion. Consider the linear programming models for players 1 and 2 given near the end of Sec. 15.5 for variation 3 of the political campaign problem (see Table 15.6). Follow the instructions of Prob. 15.5-6 for these two models.Post your question