Genetic algorithms with memory-and elitism-based immigrants in dynamic environments
Evolutionary Computation
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Variable-Size Memory Evolutionary Algorithm to Deal with Dynamic Environments
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Adaptive primal-dual genetic algorithms in dynamic environments
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Memory based on abstraction for dynamic fitness functions
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A particle swarm optimization based memetic algorithm for dynamic optimization problems
Natural Computing: an international journal
Evolvability and speed of evolutionary algorithms in light of recent developments in biology
Journal of Artificial Evolution and Applications
Memory-based CHC algorithms for the dynamic traveling salesman problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
An investigation of selection hyper-heuristics in dynamic environments
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Information Sciences: an International Journal
Expert Systems with Applications: An International Journal
Evolutionary computation for dynamic optimization problems
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
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.