Purposeful model parameters genesis in simple genetic algorithms

33Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Simple genetic algorithms have been investigated aiming to improve the algorithm convergence time. Because of the stochastic nature of genetic algorithms, several runs have to be performed in order to achieve representative results. A procedure for purposeful genesis concerning intervals of variations of model parameters is proposed for a standard simple genetic algorithm, aiming to improve significantly the algorithm effectiveness. Such a stepwise methodology is applied to parameter identification of fed-batch cultivation of S. cerevisiae. The procedure is further validated to a modified simple genetic algorithm with changed sequence of main genetic algorithm operators, namely mutation, crossover and selection, proven to be faster than the standard one. Results obtained from both applications show significant improvement of the algorithm convergence time while saving the model accuracy. © 2012 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Angelova, M., Atanassov, K., & Pencheva, T. (2012). Purposeful model parameters genesis in simple genetic algorithms. Computers and Mathematics with Applications, 64(3), 221–228. https://doi.org/10.1016/j.camwa.2012.01.047

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