1 a. Describe the idea behind the Simulated-Annealing algorithm. Be sure to briefly explain the role of each component in the following algorithm which wishes to maximize the objective function:

b. With regards to Simulated-Annealing, what is the probability of accepting the following moves? Recall that the problem is trying to maximize the objective function.

Current Evaluation.	Neighborhood Evaluation	Temp- erature.
16	15	20
25	13	25
76	75	276

function SIMULATED-ANNEALING( problem, schedule) returns a solution state inputs: problem, a problem schedule, a mapping from time to temperature current - MAKE-NODE(problem. INITIAL-STATE) for t = 1 to do T- schedule(t) if T = 0 then return current next a randomly selected successor of current - next.VALUE current.VALUE if AE>0 then current nert else current -- next only with probability AE/T function SIMULATED-ANNEALING( problem, schedule) returns a solution state inputs: problem, a problem schedule, a mapping from time to temperature current - MAKE-NODE(problem. INITIAL-STATE) for t = 1 to do T- schedule(t) if T = 0 then return current next a randomly selected successor of current - next.VALUE current.VALUE if AE>0 then current nert else current -- next only with probability AE/T