Abstract

The development of predictive models is a time consuming, knowledge intensive, iterative process where an approximate model is proposed to explain experimental data, the model parameters that best fit the data are determined and the model is subsequently refined to improve its predictive capabilities. Ascertaining the validity of the proposed model is based upon how thoroughly the parameter search has been conducted in the allowable range. The determination of the optimal model parameters is complicated by the complexity/non-linearity of the model, potentially large number of equations and parameters, poor quality of the data, and lack of tight bounds for the parameter ranges. In this paper, we will critically evaluate a hybrid search procedure that employs a genetic algorithm for identifying promising regions of the solution space followed by the use of an optimizer to search locally in the identified regions. It has been found that this procedure is capable of identifying solutions that are essentially equivalent to the global optimum reported by a state-of-the-art global optimizer but much faster. A 13 parameter model that results in 60 differential-algebraic equations for propane aromatization on a zeolite catalyst is proposed as a more challenging test case to validate this algorithm. This hybrid technique has been able to locate multiple solutions that are nearly as good with respect to the “sum of squares” error criterion, but imply significantly different physical situations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.