# Question

For each of the following pairs of parents, generate their two children when applying the basic genetic algorithm presented in Sec. 14.4 to an integer nonlinear programming problem involving only a single variable x, which is restricted to integer values over the interval 0 ≤ x ≤ 63. (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 010011 and 100101.

(b) The parents are 000010 and 001101.

(c) The parents are 100000 and 101000.

(a) The parents are 010011 and 100101.

(b) The parents are 000010 and 001101.

(c) The parents are 100000 and 101000.

## Answer to relevant Questions

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 ...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-7. (Use 1-2-3-4-5-6-7-8- 9-10-1 as the initial trial ...Consider the minimum spanning tree problem depicted below, where the dashed lines represent the potential links that could be inserted into the network and the number next to each dashed line represents the cost associated ...Consider 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. ...Section 15.5 presents a general linear programming formulation for finding an optimal mixed strategy for player 1 and for player 2. Using Table 6.14, show that the linear programming problem given for player 2 is the dual of ...Post your question

0