Suppose You Are Applying a Simulated Annealing Algorithm to a Certain

Question

Examlex · Accepted Answer

The Answer is (a)The key to solving this problem is to remember that if Z_c = objective function value for the current trial solution,Z_n = objective function value for the current candidate to be the next trial solution,so Z_c = 40 and Z_n = 36,then the move selection rule under maximization says If Z_n ≥ Z_c,always accept this candidate; if Z_n < Z_c ,accept the candidate with the following probability: Prob{acceptance} = e^x where x = .Here Z_n = 36 < 40 = Z_c and x = = -1,so Prob{acceptance} = e^-1.(b)With the objective of minimization instead,Z_n and Z_c are reversed in the above formulas.Therefore,since Z_c > Z_n ,the candidate always is accepted,so Prob{acceptance} = 1.

Suppose You Are Applying a Simulated Annealing Algorithm to a Certain

Definitions: