DISPAR-tournament: a parallel population reduction operator that behaves like a tournament

Authors:
Ogier Maitre;Deepak Sharma;Nicolas Lachiche;Pierre Collet
Affiliations:
LSIIT, UMR, Illkirch, France;LSIIT, UMR, Illkirch, France;LSIIT, UMR, Illkirch, France;LSIIT, UMR, Illkirch, France
Venue:
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Year:
2011

Citing 7
Cited 1

Calculating the expected loss of diversity of selection schemes

Evolutionary Computation
An Empirical Comparison of Selection Methods in Evolutionary Algorithms

Selected Papers from AISB Workshop on Evolutionary Computing
Unbiased tournament selection

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Predictive models for the breeder genetic algorithm i. continuous parameter optimization

Evolutionary Computation
A comparison of selection schemes used in evolutionary algorithms

Evolutionary Computation
Validity of the single processor approach to achieving large scale computing capabilities

AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Genetic drift in genetic algorithm selection schemes

IEEE Transactions on Evolutionary Computation

Two ports of a full evolutionary algorithm onto GPGPU

EA'11 Proceedings of the 10th international conference on Artificial Evolution

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an experimental study of different variants of tournament selection, and proposes a new DISPAR-tournament (Disjoint Sets Parallel tournament) operator for population reduction to be used in parallel implementations of evolution strategies and other evolutionary algorithms.