Premium
An examination of the adaptive random search technique
Author(s) -
Heuckroth M. W.,
Gaddy J. L.,
Gaines L. D.
Publication year - 1976
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.690220417
Subject(s) - random search , mathematical optimization , random variable , point (geometry) , computer science , variable (mathematics) , probability distribution , algorithm , mathematics , statistics , mathematical analysis , geometry
Random search procedures have recently been successfully applied to the optimization of a variety of chemical engineering problems, including optimization of chemical processes by flow sheet simulation. These procedures represent the independent variables as random variables described by probability distributions. The adaptive random search procedure centers the distribution for each variable about the best search point found and examines this region for a better point. Thus, this technique has the ability of continuously moving the search region toward the optimum, which is particularly advantageous in following constraints. This study examines the efficiency of the adaptive random search technique as applied to six different problems, which have been previously solved by various other techniques.