Abstract
In this paper, an adaptive domination change mechanism for diploid genetic algorithms with discrete representations is presented. It is aimed at improving the performance of existing diploid genetic algorithms in changing environments. Diploidy acts as a source of diversity in the gene pool while the adaptive domination mechanism guides the phenotype towards an optimum. The combined effect of diploidy and the adaptive domination forms a balance between exploration and exploitation. The dominance characteristic of each locus in the population is adapted through feedback from the ongoing search process. A dynamic bit matching benchmark is used to perform controlled experiments. Controlled changes to implement different levels of change severities and frequencies are used. The testing phase consists of four stages. In the first stage, the benefits of the adaptive domination mechanism are shown by testing it against previously proposed diploid approaches. In the second stage, the same adaptive approach is applied to a haploid genetic algorithm to show the effect of the diploidy on the performance of the proposed approach. In the third stage, the levels of diversity introduced by diploidy on the genotype and maintained by the adaptive domination mechanism on the phenotype are explored. In the fourth stage, tests are performed to examine the robustness of the chosen approaches against different mutation rates. Currently, the dominance change mechanism can be applied to di-allelic or multiallelic discrete representations and promising results are obtained as a result of the tests performed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
A similar approach is implemented by Uyar et al. (2004) to adapt mutation rates in static environments.
References
Baluja S, Caruana R (1995) Removing the genetics from the standard genetic algorithm. In: Proceedings of international conference on machine learning, Morgan Kaufmann, pp 38–46
Branke J (1999) Memory enhanced evolutionary algorithms for changing optimization problems. Congress on evolutionary computation CEC99, IEEE, pp 1875–1882
Branke J (2002) Evolutionary optimization in dynamic environments. Kluwer, Dordrecht
Branke J, Schmeck H (2002) Designing evolutionary algorithms for dynamic optimization problems. In: Tsutsui S, Ghosh A (eds) Theory and application of evolutionary computation: recent trends. Springer, Berlin Heidelberg New York, pp 239–262
Cantu-Paz E (2002) On random numbers and the performance of genetic algorithms. Genetic and evolutionary computation conference GECCO’02. Morgan Kaufman, pp 311–318
Cobb HG (1990) An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent, nonstationary environments. Technical report AIC-90-001, Naval research Laboratory
Collingwood E, Corne D, Ross P (1996) Useful diversity via multiploidy. In: Proceedings of AISB workshop on evolutionary computation
Curtis H, Barnes NS (1981) Invitation to Biology, 3rd edn. Worth, New York
Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evolut Comput 3(2):124–141
Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading
Greene F (1996) A method for utilizing diploid/dominance in genetic search. In: Proceedings of the first IEEE conference on evolutionary computation
Grefenstette JJ (1992) Genetic algorithms for changing environments. Parallel problem solving from nature 2. North Holland, pp 137–144
Hadad BS, Eick CF (1997) Supporting polyploidy in genetic algorithms using dominance vectors. In: Proceedings of the sixth international conference on evolutionary programming, Vol 1213. Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York
Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
Lewis J, Hart E, Graeme R (1998) A comparison of dominance mechanisms and simple mutation on non-stationary problems. In: Proceedings of parallel problem solving from nature, Vol 1498. Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York
Mori N, Kita H, Nishikawa Y (1996) Adaptation to a changing environment by means of the thermodynamical genetic algorithm. Parallel problem solving from nature, Vol 1141. Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York, pp 513–522
Ng KP, Wong KC (1995) A new diploid scheme and dominance change mechanism for non-stationary function optimization. In: Proceedings of the sixth international conference on genetic algorithms
Ryan C (1994) The degree of oneness. In: Proceedings of the 1994 ECAI workshop on genetic algorithms. Springer, Berlin Heidelberg New York
Smith RE, Goldberg DE (1992) Diploidy and dominance in artificial genetic search. Complex Syst 6:251–285
Uyar AS, Harmanci AE (1999) Investigation of new operators for a diploid genetic algorithm. Proceedings of SPIE: applications and science of neural networks. Fuzzy systems and evolutionary computation II
Uyar AS, Harmanci AE (2002) Preserving diversity through diploidy and meiosis for improved GA performance in dynamic environments, Vol 2457. Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, pp 314–323
Uyar AS, Harmanci AE (2002) Performance comparisons of genotype to phenotype mapping schemes for diploid representations in changing environments. Recent advances in soft computing RASC’02
Uyar AS, Harmanci AE (2003) An adaptive domination map approach for multi-allelic diploid genetic algorithms. Genetic and evolutionary computation congress, GECCO 2003, Late breaking papers, pp 291–298
Uyar AS, Harmanci AE (2004) Comparison of domination approaches for diploid binary genetic algorithms. Applications and science in soft computing, Advances in soft computing. Springer, Berlin Heidelberg New York, pp 75–80
Uyar AS, Sariel S, Eryigit G (2004) A gene based adaptive mutation strategy for genetic algorithms. accepted for publication in genetic and evolutionary computation conference, GECCO’04. Springer, Berlin Heidelberg New York
Vavak F, Jukes K, Fogarty TC (1997) Adaptive combustion balancing in multiple burner boiler using a genetic algorithm with variable range of local search. Seventh international conference on evolutionary programming, Vol 1213. Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York, pp 719–726
Acknowledgements
The authors would like to thank the editor and the anonymous reviewers of the Soft Computing journal for their most helpful comments and patience.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Uyar, A.Ş., Harmanci, A.E. A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments. Soft Comput 9, 803–814 (2005). https://doi.org/10.1007/s00500-004-0421-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-004-0421-4