Comparison of simulated annealing algorithms in the scheduling of multiproduct serial batch plants

V. Ruiz Ahon, F. W. Tavares, M. Castier

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)199-209
Number of pages11
JournalBrazilian Journal of Chemical Engineering
Volume17
Issue number2
Publication statusPublished - Jun 2000
Externally publishedYes

Fingerprint

Simulated annealing
Scheduling
Statistics
Annealing

ASJC Scopus subject areas

  • Chemical Engineering(all)

Cite this

Comparison of simulated annealing algorithms in the scheduling of multiproduct serial batch plants. / Ahon, V. Ruiz; Tavares, F. W.; Castier, M.

In: Brazilian Journal of Chemical Engineering, Vol. 17, No. 2, 06.2000, p. 199-209.

Research output: Contribution to journalArticle

@article{8a2d6cd9bb224a5aa5d3a896c8d87188,
title = "Comparison of simulated annealing algorithms in the scheduling of multiproduct serial batch plants",
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.",
author = "Ahon, {V. Ruiz} and Tavares, {F. W.} and M. Castier",
year = "2000",
month = "6",
language = "English",
volume = "17",
pages = "199--209",
journal = "Brazilian Journal of Chemical Engineering",
issn = "0104-6632",
publisher = "Association Brasiliera de Eng. Quimica / Braz. Soc. Chem. Eng.",
number = "2",

}

TY - JOUR

T1 - Comparison of simulated annealing algorithms in the scheduling of multiproduct serial batch plants

AU - Ahon, V. Ruiz

AU - Tavares, F. W.

AU - Castier, M.

PY - 2000/6

Y1 - 2000/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033728448&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033728448&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033728448

VL - 17

SP - 199

EP - 209

JO - Brazilian Journal of Chemical Engineering

JF - Brazilian Journal of Chemical Engineering

SN - 0104-6632

IS - 2

ER -