Differential evolution for the offline and online optimization of fed-batch fermentation processes

8Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The optimization of input variables (typically feeding trajectories over time) in fed-batch fermentations has gained special attention, given the economic impact and the complexity of the problem. Evolutionary Computation (EC) has been a source of algorithms that have shown good performance in this task. In this chapter, Differential Evolution (DE) is proposed to tackle this problem and quite promising results are shown. DE is tested in several real world case studies and compared with other EC algorihtms, such as Evolutionary Algorithms and Particle Swarms. Furthermore, DE is also proposed as an alternative to perform online optimization, where the input variables are adjusted while the real fermentation process is ongoing. In this case, a changing landscape is optimized, therefore making the task of the algorithms more difficult. However, that fact does not impair the performance of the DE and confirms its good behaviour. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Mendes, R., Rocha, I., Pinto, J. P., Ferreira, E. C., & Rocha, M. (2008). Differential evolution for the offline and online optimization of fed-batch fermentation processes. Studies in Computational Intelligence, 143, 299–317. https://doi.org/10.1007/978-3-540-68830-3_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free