A Systematic Mapping Study on Diploid Genetic Algorithms

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.