Credit assignment in adaptive evolutionary algorithms

Authors:
James M. Whitacre;Tuan Q. Pham;Ruhul A. Sarker
Affiliations:
University of New South Wales, Sydney, Australia;University of New South Wales, Sydney, Australia;University of New South Wales, Canberra, Australia
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 6
Cited 4

Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis

Artificial Intelligence Review
Adaptive operator probabilities in a genetic algorithm that applies three operators

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Competitive Evolution: A Natural Approach to Operator Selection

AI '93/AI '94 Selected papers from the AI'93 and AI'94 Workshops on Evolutionary Computation, Process in Evolutionary Computation
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
Hybrid crossover operators for real-coded genetic algorithms: an experimental study

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Use of statistical outlier detection method in adaptive evolutionary algorithms

Proceedings of the 8th annual conference on Genetic and evolutionary computation

Use of statistical outlier detection method in adaptive evolutionary algorithms

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Population-based algorithm portfolios for numerical optimization

IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
Off-line and on-line tuning: a study on operator selection for a memetic algorithm applied to the QAP

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Estimating meme fitness in adaptive memetic algorithms for combinatorial problems

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new method for assigning credit to search operators is presented. Starting with the principle of optimizing search bias, search operators are selected based on an ability to create solutions that are historically linked to future generations. Using a novel framework for defining performance measurements, distributing credit for performance, and the statistical interpretation of this credit, a new adaptive method is developed and shown to outperform a variety of adaptive and non-adaptive competitors.