Tuning Genetic Algorithm Parameters to Improve Convergence Time
Fermentation processes by nature are complex, time-varying, and highly nonlinear. As dynamic systems their modeling and further high-quality control are a serious challenge. The conventional optimization methods cannot overcome the fermentation processes peculiarities and do not lead to a satisfying...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2011-01-01
|
| Series: | International Journal of Chemical Engineering |
| Online Access: | http://dx.doi.org/10.1155/2011/646917 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Fermentation processes by nature are complex, time-varying, and highly nonlinear. As dynamic systems their modeling and further high-quality control are a serious challenge. The conventional optimization methods cannot overcome the fermentation processes peculiarities and do not lead to a satisfying solution. As an alternative, genetic algorithms as a stochastic global optimization method can be applied. For the purpose of parameter identification of a fed-batch cultivation of S. cerevisiae altogether four kinds of simple and four kinds of multipopulation genetic algorithms have been considered. Each of them is characterized with a different sequence of implementation of main genetic operators, namely, selection, crossover, and mutation. The influence of the most important genetic algorithm parameters—generation gap, crossover, and mutation rates has—been investigated too. Among the considered genetic algorithm parameters, generation gap influences most significantly the algorithm convergence time, saving up to 40% of time without affecting the model accuracy. |
|---|---|
| ISSN: | 1687-806X 1687-8078 |