A New Innovative Cooling Law for Simulated Annealing Algorithms

The present paper proposes an original and innovative cooling law in the field of Simulated Annealing (SA) algorithms. Particularly, such a law is based on the evolution of different initial seeds on which the algorithm works in parallel. The efficiency control of the new proposal, executed on problems of different kind, shows that the convergence quickness by using such a new cooling law is considerably greater than that obtained by traditional laws. Furthermore, it is shown that the effectiveness of the SA algorithm arising from the proposed cooling law is independent of the problem type. This last feature reduces the number of parameters to be initially fixed, so simplifying the preliminary calibration process necessary to optimize the algorithm efficiency.