# Question: While applying a simulated annealing algorithm to a certain problem

While applying a simulated annealing algorithm to a certain problem, you have come to an iteration where the current value of T is T = 2 and the value of the objective function for the current trial solution is 30. This trial solution has four immediate neighbors and their objective function values are 29, 34, 31, and 24. For each of these four immediate neighbors in turn, you wish to determine the probability that the move selection rule would accept this immediate neighbor if it is randomly selected to become the current candidate to be the next trial solution.

(a) Determine this probability for each of the immediate neighbors when the objective is maximization of the objective function.

(b) Determine this probability for each of the immediate neighbors when the objective is minimization of the objective function.

(a) Determine this probability for each of the immediate neighbors when the objective is maximization of the objective function.

(b) Determine this probability for each of the immediate neighbors when the objective is minimization of the objective function.

## Answer to relevant Questions

Reconsider the traveling salesman problem shown in Prob. 14.1-1. Using 1-2-3-4-5-1 as the initial trial solution, you are to follow the instructions below for applying the basic simulated annealing algorithm presented in ...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 ...Consider the traveling salesman problem shown below, where city 1 is the home city. For the game having the following payoff table, determine the optimal strategy for each player by successively eliminating dominated strategies. (Indicate the order in which you eliminated strategies.) 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 ...Post your question