A note on the variance of rank-based selection strategies for genetic algorithms and genetic programming

Authors:
Artem Sokolov;Darrell Whitley;Andre' Motta Salles Barreto
Affiliations:
Department of Computer Science, Colorado State University, Fort Collins, USA 80523;Department of Computer Science, Colorado State University, Fort Collins, USA 80523;Programa de Engenharia Civil/COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil
Venue:
Genetic Programming and Evolvable Machines
Year:
2007

Citing 14
Cited 2

The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best

Proceedings of the third international conference on Genetic algorithms
Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Evolving artificial intelligence

Evolving artificial intelligence
Genetic Reinforcement Learning for Neurocontrol Problems

Machine Learning - Special issue on genetic algorithms
Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Evaluating evolutionary algorithms

Artificial Intelligence - Special volume on empirical methods
Weight-biased edge-crossover in evolutionary algorithms for two graph problems

Proceedings of the 2001 ACM symposium on Applied computing
Evolution and Optimum Seeking: The Sixth Generation

Evolution and Optimum Seeking: The Sixth Generation
Calculating the expected loss of diversity of selection schemes

Evolutionary Computation
Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Learning and problem-solving with multilayer connectionist systems (adaptive, strategy learning, neural networks, reinforcement learning)

Learning and problem-solving with multilayer connectionist systems (adaptive, strategy learning, neural networks, reinforcement learning)
Unbiased tournament selection

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A comparison of selection schemes used in evolutionary algorithms

Evolutionary Computation
Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithms

FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms

Spatial processing layer effects on the evolution of neural networks to play the game of Othello

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A human-computer cooperative particle swarm optimization based immune algorithm for layout design

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper evaluates different forms of rank-based selection that are used with genetic algorithms and genetic programming. Many types of rank based selection have exactly the same expected value in terms of the sampling rate allocated to each member of the population. However, the variance associated with that sampling rate can vary depending on how selection is implemented. We examine two forms of tournament selection and compare these to linear rank-based selection using an explicit formula. Because selective pressure has a direct impact on population diversity, we also examine the interaction between selective pressure and different mutation strategies.