Abstract
Optimization techniques are finding increasingly numerous applications in process design, in parallel to the increase of computer sophistication. The process synthesis problem can be stated as a largescale constrained optimization problem involving numerous local optima and presenting a nonlinear and nonconvex character. To solve this kind of problem, the classical optimization methods can lead to analytical and numerical difficulties. This paper describes the feasibility of an optimization technique based on learning systems which can take into consideration all the prior information concerning the process to be optimized and improve their behavior with time. This information generally occurs in a very complex analytical, empirical, or know-how form. Computer simulations related to chemical engineering problems (benzene chlorination, distillation sequence) and numerical examples are presented. The results illustrate both the performance and the implementation simplicity of this method.
Similar content being viewed by others
Abbreviations
- c i :
-
penalty probability
- cp :
-
precision parameter on constraints
- D :
-
variation domain of the variablex
- f(·):
-
objective function
- g(·):
-
constraints
- i,j :
-
indexes
- k :
-
iteration number
- N :
-
number of actions
- P :
-
probability distribution vector
- p i :
-
ith component of the vectorP as iterationk
- r :
-
number of reactors in the flowsheet
- u(k):
-
discrete value or action chosen by the algorithm at iterationk
- u i :
-
discrete value of the optimization variable in [u min,u max]
- u min :
-
lowest value of the optimization variable
- u max :
-
largest value of the optimization variable
- Z :
-
random number
- x :
-
variable for the criterion function
- xp :
-
precision parameter on criterion function
- W(k):
-
performance index unit output at iterationk
- β 0, β1 :
-
reinforcement scheme parameters
- ∑ p :
-
sum of the probability distribution vector components
References
Grossmann, I. E.,Mixed-Integer Programming Approach for the Synthesis of Integrated Process Flowsheets, Computer and Chemical Engineering Journal, Vol. 9, pp. 463–482, 1985.
Abadie, J.,The GRG Method for Nonlinear Programming, Design and Implementation of Optimization Software, Edited by H. Greenberg, New York, New York, 1968.
Murtagh, B. A., andSaunders, M. A.,The Implementation of a Lagrangian-Based Algorithm for Sparse Nonlinear Constraints, Report No. SOL 80-1, Stanford University, Stanford, California, 1980.
Rudd, D. F., andWatson, C. C.,Strategy of Process Engineering, Wiley, New York, New York, 1968.
Le Lann, M. V., Najim, K., andCasamatta, G.,Learning Control of a Pulsed Liquid-Liquid Extraction Column, Chemical Engineering Science, Vol. 42, pp. 1619–1628, 1987.
Secret, D., andMacchi, O.,Automates Adaptatifs Optimaux, Techniques et Science Informatiques, Vol. 1, pp. 143–151, 1982.
Nishida, N., Stephanopoulos, G., andWesterberg, A. W.,A Review of Process Synthesis, AIChE Journal, Vol. 27, pp. 321–351, 1981.
Pibouleau, L., andDomenech, S.,Discrete and Continuous Approaches to the Optimal Synthesis of Distillation Sequences, Computer and Chemical Engineering Journal, Vol. 10, pp. 479–492, 1986.
Barona, N., andPrengle, W. A., Jr.,Design Reactors This Way for Liquid-Phase Processes, Hydrocarbbon Processing, Vol. 52, pp. 73–90, 1973.
Wild, G., Midoux, N., andCharpentier, J. C.,Dimensionnement d'un Réacteur Agité pour la Fabrication de Monochlorobenzene, Energétique Industrielle, Edited by P. Le Goff, Technique et Documentation, Paris, France, 1980.
Bodman, S. W.,The Industrial Practice of Chemical Process Engineering, MIT Press, Cambridge, Massachusetts, 1968.
Floquet, P.,Procédures Discrète et Continue d'Optimisation et de CAO en Génie Chimique—Etude de Cas, Thèse de Doctorat, Institute National Polytechnique des Toulouse, Toulouse, France, 1986.
Author information
Authors and Affiliations
Additional information
Communicated by R. W. H. Sargent
Rights and permissions
About this article
Cite this article
Najim, K., Pibouleau, L. & Le Lann, M.V. Optimization technique based on learning automata. J Optim Theory Appl 64, 331–347 (1990). https://doi.org/10.1007/BF00939452
Issue Date:
DOI: https://doi.org/10.1007/BF00939452