个人信息Personal Information
教授
博士生导师
硕士生导师
性别:男
毕业院校:大连理工大学
学位:博士
所在单位:能源与动力学院
学科:热能工程. 化学工程. 运筹学与控制论
办公地点:大连理工大学能源与动力学院712室
联系方式:电话:13940865971 邮箱:hcyin@dlut.edu.cn
电子邮箱:hcyin@dlut.edu.cn
Robust parameter identification using parallel global optimization for a batch nonlinear enzyme-catalytic time-delayed process presenting metabolic discontinuities
点击次数:
论文类型:期刊论文
发表时间:2017-06-01
发表刊物:APPLIED MATHEMATICAL MODELLING
收录刊物:SCIE、EI
卷号:46
页面范围:554-571
ISSN号:0307-904X
关键字:Nonlinear time-delayed switched system; Biological robustness; Parallel optimization; Batch culture; Convergence analysis
摘要:In this paper, a nonlinear enzyme-catalytic time-delayed switched dynamical system is considered to describe batch culture of glycerol bioconversion to 1,3-propanediol induced by Klebsiella pneumoniae. This system can not only predict the exponential growth phase but also the lag and the stationary growth phases of batch culture since it contains two switching times for representing the starting moment of lag growth phase and the time when the cell specified growth rate reaches the maximum. The biological robustness is expressed in terms of the expectation and variance of the relative deviation. Our aim is to identify the switching times. To this end, a robust parameter identification problem is formulated, where the switching times are decision variables to be chosen such that the biological robustness measure is optimized. This problem, which is governed by the non-linear system, is subject to a quality constraint and continuous state inequality constraints. Using a hybrid time-scaling transformation to parameterize the switching times into new parameters, an equivalently robust parameter identification problem is investigated. The continuous state inequality constraints are approximated by a conventional inequality constraint, yielding a sequence of approximate robust parameter identification subproblems. The convergence analysis of this approximation is also investigated. Owing to the highly complex nature of these subproblems, a parallel algorithm, based on simulated annealing, is proposed to solve these subproblems. From an extensive simulation study, it is observed that the obtained optimal switching times are satisfactory. (C) 2017 Elsevier Inc. All rights reserved.