Table 1 Pseudo code for the description of simulated annealing[12, 17]

2:

Select an initial temperature T = T₀ > 0;

3:

Select a neighborhood structure N(x);

4:

Select a temperature reduction function R(T);

5:

Select the number G of iterations executed at each temperature T;

6:

Select the number of times U the temperature is reduced;

7:

Set the counter u of the number of times the temperature is reduced to 0;

8:

Repeat

9:

Set the repetition counter g = 0;

10:

Repeat

11:

Generate a solution x’ ∈ N(x);

12:

Calculate ∆_x,x’ = f(x) – f(x’);

13:

if ∆_x,x’ ≤ 0, then x ← x’;

14:

if ∆_x,x’ > 0, then x ← x’ with probability exp(−∆_x,x’/T);

15:

g ← g + 1;

16:

Until g = G;

17:

T ← R(T);

18:

u ← u + 1;

19:

Until u = U