A Multiple Mitosis Genetic Algorithm

K. Kamil, K.H Chong, H. Hashim, S.A. Shaaya

Abstract


Genetic algorithm is a well-known metaheuristic method to solve optimization problem mimic the natural process of cell reproduction. Having great advantages on solving optimization problem makes this method popular among researchers to improve the performance of simple Genetic Algorithm and apply it in many areas. However, Genetic Algorithm has its own weakness of less diversity which cause premature convergence where the potential answer trapped in its local optimum.  This paper proposed a method Multiple Mitosis Genetic Algorithm to improve the performance of simple Genetic Algorithm to promote high diversity of high-quality individuals by having 3 different steps which are set multiplying factor before the crossover process, conduct multiple mitosis crossover and introduce mini loop in each generation. Results shows that the percentage of great quality individuals improve until 90 percent of total population to find the global optimum.


Keywords


Crossover, De’Jong function, Diversity, Fast convergence, Genetic algorithm

Full Text:

PDF


DOI: http://doi.org/10.11591/ijai.v8.i3.pp%25p
Total views : 28 times

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 Institute of Advanced Engineering and Science

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

View IJAI Stats

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.