Optimization of fed-batch fermentation processes with bio-inspired algorithms

Authors:
Miguel Rocha;Rui Mendes;Orlando Rocha;Isabel Rocha;Eugénio C. Ferreira
Affiliations:
-;-;-;-;-
Venue:
Expert Systems with Applications: An International Journal
Year:
2014

Citing 9
Cited 0

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Implicit-explicit Runge-Kutta methods for time-dependent partial differential equations

Applied Numerical Mathematics - Special issue on time integration
Population structure and particle swarm performance

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Population structure and particle swarm performance

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Implementing Metaheuristic Optimization Algorithms with JECoLi

ISDA '09 Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation
The fully informed particle swarm: simpler, maybe better

IEEE Transactions on Evolutionary Computation
Optimization methodology based on neural networks and self-adaptive differential evolution algorithm applied to an aerobic fermentation process

Applied Soft Computing
A comparison among stochastic optimization algorithms for parameter estimation of biochemical kinetic models

Applied Soft Computing

Quantified Score

Hi-index	12.05

Visualization

Abstract

The optimization of the feeding trajectories in fed-batch fermentation processes is a complex problem that has gained attention given its significant economical impact. A number of bio-inspired algorithms have approached this task with considerable success, but systematic and statistically significant comparisons of the different alternatives are still lacking. In this paper, the performance of different metaheuristics, such as Evolutionary Algorithms (EAs), Differential Evolution (DE) and Particle Swarm Optimization (PSO) is compared, resorting to several case studies taken from literature and conducting a thorough statistical validation of the results. DE obtains the best overall performance, showing a consistent ability to find good solutions and presenting a good convergence speed, with the DE/rand variants being the ones with the best performance. A freely available computational application, OptFerm, is described that provides an interface allowing users to apply the proposed methods to their own models and data.