Towards implementing the algorithm

As is shown in chapter 3, the simulated annealing algorithm in its original formulation converges with probability 1 to a globally minimal configuration in either one of the following two cases: 1. for each value of the control parameter, c k , an infinite number of transitions is generated and limk→∞ c k (the homogeneous algorithm); 2. for each value ck one transition is generated and ck goes to zero not faster than O ([log k]−1) (the inhomogeneous algorithm).