Comparison of optimization algorithms for modeling of Haldane-type growth kinetics during phenol and benzene degradation
- Authors
- Kang, Su-Youn; Lee, Sang-Gil; Kim, Dong-Ju; Shin, Jaemin; Kim, Junseok; Lee, Soonjae; Choi, Jae-Woo
- Issue Date
- 15-2월-2016
- Publisher
- ELSEVIER
- Keywords
- Modeling; Optimization; Kinetic parameters; Growth kinetics; Microbial growth; Phenol; Benzene
- Citation
- BIOCHEMICAL ENGINEERING JOURNAL, v.106, pp.118 - 124
- Indexed
- SCIE
SCOPUS
- Journal Title
- BIOCHEMICAL ENGINEERING JOURNAL
- Volume
- 106
- Start Page
- 118
- End Page
- 124
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/89520
- DOI
- 10.1016/j.bej.2015.11.012
- ISSN
- 1369-703X
- Abstract
- In this study, three optimization algorithms (discretized domain, Monte Carlo, steepest descent) were compared to determine the best algorithm for estimation of Haldane-type microbial growth kinetic parameters. Application of these algorithms to growth data measured during phenol and benzene degradation showed different results in the estimated parameters obtained under various boundary conditions and growth phases. Regardless of the specific algorithm used, the factor with the greatest influence on parameter estimation was the boundary condition for the half-saturation constant (K-S), although the parameters were also sensitive to the growth phase for phenol. Among the three algorithms, Monte Carlo was found to be the best and most consistent. The estimated parameters of phenol and benzene using an appropriate boundary value of K-S were comparable with the outputs reported in previous studies, but those derived with inappropriate boundary values were not consistent with previously reported data. (c) 2015 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Mathematics > 1. Journal Articles
- College of Science > Department of Earth and Environmental Sciences > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.