A comparison of simulated annealing algorithms in the scheduling of multiproduct serial batch plants



Document title: A comparison of simulated annealing algorithms in the scheduling of multiproduct serial batch plants
Journal: Brazilian journal of chemical engineering
Database: PERIÓDICA
System number: 000308725
ISSN: 0104-6632
Authors: 1

1
Institutions: 1Universidade Federal do Rio de Janeiro, Escola de Quimica, Rio de Janeiro. Brasil
Year:
Season: Jun
Volumen: 17
Number: 2
Pages: 199-209
Country: Brasil
Language: Inglés
Document type: Artículo
Approach: Experimental, aplicado
English abstract In this work, several simulated annealing algorithms presented in the literature as solutions to different problems were compared in the scheduling of multiproduct serial batch plants. A systematic performance study of the original algorithm, based on the Boltzmann statistics, and a recently proposed algorithm, based on the Tsallis statistics, were analyzed for three different 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 minimum more frequently than those based on the Boltzmann statistics, although they needed a larger number of configurations to obtain the results
Disciplines: Ingeniería
Keyword: Ingeniería industrial,
Ingeniería química
Keyword: Engineering,
Chemical engineering,
Industrial engineering
Full text: Texto completo (Ver HTML)