Downloads: 120 | Views: 274

Survey Paper | Computer Science & Engineering | India | Volume 3 Issue 10, October 2014 | Popularity: 6.4 / 10

Rate This Article!      

A Systematic Mapping Study on Diploid Genetic Algorithms

Surbhi Bhatia, Kamiya Arora

Abstract: Diploid Genetic Algorithm is an approach for addressing performance and diversity issues in dynamic environments. Unlike the conventional implementation of genetic algorithm in various applications lacks in giving optimal performance as they deal with the static environment. There are problems where environment may change dynamically with time. In such cases, it becomes necessary to deal with this change. The paper defines and explains that diploid genetic algorithm increases diversity and adapts more quickly as the recessive genes become active whenever the environment changes dynamically. The paper investigates to present the diploidy representation by giving performance comparisons of some of the existing genotype to phenotype mapping. In the work explored, we take a systematic mapping study by presenting a broader survey of diploid genetic algorithms. The paper focuses to enable the academics and practitioners in order to examine the varied perspectives and applications where diploid genetic algorithms can give the direct efforts for future research.

Keywords: Diploid Genetic Algorithm DGA, Diploidy and Dominance, Dynamic Optimization Problem DOPS, Genetic Algorithm GA, Genotype to Phenotype Mapping

Edition: Volume 3 Issue 10, October 2014

Pages: 648 - 651

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles