Tracking Extrema in Dynamic Fitness Functions with Dissortative Mating Genetic Algorithms

Authors:
C. M. Fernandes;J. J. Merelo;A. C. Rosa
Affiliations:
-;-;-
Venue:
HIS '08 Proceedings of the 2008 8th International Conference on Hybrid Intelligent Systems
Year:
2008

Citing 0
Cited 2

A comparative study on the performance of dissortative mating and immigrants-based strategies for evolutionary dynamic optimization

Information Sciences: an International Journal
The sandpile mutation Genetic Algorithm: an investigation on the working mechanisms of a diversity-oriented and self-organized mutation operator for non-stationary functions

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the behavior of the Adaptive Dissortative Mating Genetic Algorithm (ADMGA) on dynamic problems and compares it with other Genetic Algorithms (GA). ADMGA is a non-random mating algorithm that selects parents according to their Hamming distance, via a self-adjustable threshold value. The resulting method, by keeping population diversity during the run, provides new means for GAs to deal with dynamic problems, which demand high diversity in order to track the optima. Tests conducted on combinatorial and trap functions indicate that ADMGA is more robust than traditional GAs and it is capable of outperforming a previously proposed dis-sortative scheme on a wide range of tests.