Dominance learning in diploid genetic algorithms for dynamic optimization problems

Authors:
Shengxiang Yang
Affiliations:
University of Leicester, Leicester, United Kingdom
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 3
Cited 0

A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization

Proceedings of the 6th International Conference on Genetic Algorithms
A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Experimental study on population-based incremental learning algorithms for dynamic optimization problems

Soft Computing - A Fusion of Foundations, Methodologies and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus is controlled by a dominance probability, which is learned adaptively during the searching progress and hence is adapted to the dynamic environment. Using a series of dynamic test problems, the proposed dominance scheme is compared to two other dominance schemes for diploidy genetic algorithms. The experimental results validate the efficiency of the proposed dominance learning scheme.