Abstract
Process optimization often leads to nonconvex nonlinear programming problems, which may have multiple local optima. There are two major approaches to the identification of the global optimum: deterministic approach and stochastic approach. Algorithms based on the deterministic approach guarantee the global optimality of the obtained solution, but are usually applicable to small problems only. Algorithms based on the stochastic approach, which do not guarantee the global optimality, are applicable to large problems, but inefficient when nonlinear equality constraints are involved. This paper reviews representative deterministic and stochastic global optimization algorithms in order to evaluate their applicability to process design problems, which are generally large, and have many nonlinear equality constraints. Finally, modified stochastic methods are investigated, which use a deterministic local algorithm and a stochastic global algorithm together to be suitable for such problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adjiman, C. S., Androulakis, I. P., Maranas, C. D. and Floudas, C. A., “A Global Optimization Method, αBB, for Process Design”Computers & Chem. Eng.,20, Suppl, S419 (1996).
Back, T., Hoffmeister, F. and Schwefel, H.-P, “A Survey of Evolution Strategies,” Proceedings of the Fourth International Conference on Genetic Algorithms, R. K. Belew and L. B. Booker, eds., Morgan Kaufmann, San Mateo, CA, 2 (1991).
Bagajewicz, M. and Manousiouthakis, V, “On the Generalized Benders Decomposition,”Computers & Chem. Eng.,15, 691 (1991).
Booker, L. B., “Improving Search in Genetic Algorithms,” Genetic Algorithms and Simulated Annealing, L. Davis, ed., Pitman, London, 61 (1987).
Choi, S. H., Ko, J. W. and Manousiouthakis, V, “A Stochastic Approach to Global Optimization of Chemical Processes,”Computers & Chem. Eng.,23,1351(1999).
Floudas C. A. and Visweswaran, V, “A Global Optimization Algorithm (GOP) for Certain Classes of Nonconvex NLPs-I. Theory,”Computers & Chem. Eng.,14,1397 (1990).
Geoffrion, A. M., “Generalized Benders Decomposition,”J. Opt. Theory Applic,10,237 (1972).
Goldberg, D. E., “Genetic Algorithms in Search, Optimization, and Machine Learning,” Addison-Wesley, Reading, MA (1989).
Han, J. R, Manousiouthakis, V. and Choi, S. H., “Global Optimization of Chemical Processes Using the Interval Analysis,”Korean J. Chem. Eng.,14, 270 (1997).
Horst, R. and Tuy, H, “Global Optimization: Deterministic Approaches,” 2nd ed., Springer-Verlag, Berlin, Germany (1993).
Kirkpatrick, S., Gelatt, Jr. C. D. and Vecchi, M. P., “Optimization by Simulated Annealing,”Science,220, 671 (1983).
Konno, H., Thach, P. T. and Tuy, H, “Optimization on Low Rank Nonconvex Structures,” Kluwer Academic Publishers, Dordrecht, The Netherlands (1997).
Michalewicz, Z., “Genetic Algorithms+Data Structures=Evolution Programs,” 3rd ed., Springer-Verlag, New York (1996).
Ratschek, H. and Rokne, J., “New Computer Methods for Global Optimization,” Ellis Horwood, Chichester, England (1988).
Ryoo, H. S. and Sahinidis, N V, “Global Optimization of Nonconvex NLPs and MENLPs with Applications in Process Design,”Computers & Chem. Eng.,19, 551 (1995).
Soland, R. M., “An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints,”Management Science,17, 759 (1971).
Vaidyanathan, R. and El-Halwagi, M., “Global Optimization of Nonconvex Nonlinear Programs via Interval Analysis,”Computers & Chem. Eng.,18, 889 (1994).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Choi, S.H., Manousiouthakis, V. Global optimization methods for chemical process design: Deterministic and stochastic approaches. Korean J. Chem. Eng. 19, 227–232 (2002). https://doi.org/10.1007/BF02698406
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02698406