Journal
COMPUTERS & CHEMICAL ENGINEERING
Volume 63, Issue -, Pages 108-139Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2013.12.014
Keywords
Black-box optimization; Process optimization; Non-smooth optimization; Direct-search methods; Evolutionary algorithms
Ask authors/readers for more resources
In the areas of chemical processes and energy systems, the relevance of black-box optimization problems is growing because they arise not only in the optimization of processes with modular/sequential simulation codes but also when decomposing complex optimization problems into bilevel programs. The objective function is typically discontinuous, non-differentiable, not defined in some points, noisy, and subject to linear and nonlinear relaxable and unrelaxable constraints. In this work, after briefly reviewing the main available direct-search methods applicable to this class of problems, we propose a new hybrid algorithm, referred to as PGS-COM, which combines the positive features of Constrained Particle Swarm, Generating Set Search, and Complex. The remarkable performance and reliability of PGS-COM are assessed and compared with those of eleven main alternative methods on twenty five test problems as well as two challenging process engineering applications related to the optimization of a heat recovery steam cycle and a styrene production process. (C) 2014 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available