Vr. Ahon et al., A comparison of simulated annealing algorithms in the scheduling of multiproduct serial batch plants, BRAZ J CH E, 17(2), 2000, pp. 199-209
In this work, several simulated annealing algorithms presented in the liter
ature as solutions to different problems were compared in the scheduling of
multiproduct serial batch plants. A systematic performance study of the or
iginal algorithm, based on the Boltzmann statistics, and a recently propose
d algorithm, based on the Tsallis statistics, were analyzed for three diffe
rent annealing schemes. It was observed that performance (defined in terms
of the number of configurations) is more sensitive to the annealing scheme
than to the statistics used. We also observed that the overall performance
of the simulated annealing procedure is very dependent on the parameters of
the algorithm and on the kind and size of the problems. For large problems
, algorithms based on the Tsallis statistics converged to the global minimu
m more frequently than those based on the Boltzmann statistics, although th
ey needed a larger number of configurations to obtain the results.