A comparison of binary and continuous genetic algorithm in parameter estimation of a logistic growth model

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

Abstract

Genetic algorithm is an optimization method based on the principles of genetics and natural selection in life organisms. The algorithm begins by defining the optimization variables, defining the cost function (in a minimization problem) or the fitness function (in a maximization problem) and selecting genetic algorithm parameters. The main procedures in genetic algorithm are generating initial population, selecting some chromosomes (individual) as parent's individual, mating, and mutation. In this paper, binary and continuous genetic algorithms were implemented to estimate growth rate and carrying capacity parameter from poultry data cited from literature. For simplicity, all genetic algorithm parameters (selection rate and mutation rate) are set to be constant along implementation of the algorithm. It was found that by selecting suitable mutation rate, both algorithms can estimate these parameters well. Suitable range for mutation rate in continuous genetic algorithm is wider than the binary one.

Cite

CITATION STYLE

APA

Windarto, Indratno, S. W., Nuraini, N., & Soewono, E. (2014). A comparison of binary and continuous genetic algorithm in parameter estimation of a logistic growth model. In AIP Conference Proceedings (Vol. 1587, pp. 139–142). American Institute of Physics Inc. https://doi.org/10.1063/1.4866550

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