selRanking: Rank Selection Operator

selRankingR Documentation

Rank Selection Operator

Description

Rank-based selection preserves a constant selection pressure by sorting the population on the basis of fitness, and then allocating selection probabilities to individuals according to their rank, rather than according to their actual fitness values.

Usage

selRanking(fitness, n.select, s = 1.5, scheme = "linear")

Arguments

fitness

[matrix]
Matrix of fitness values (each column contains the fitness value(s) of one individual).

n.select

[integer(1)]
Number of elements to select.

s

[numeric(1)]
Selection pressure for linear ranking scheme with value range [0,1]. Ignored if scheme is set to “exponential”. Default is 1.5.

scheme

[character(1)]
Mapping from rank number to selection probability, either “linear” or “exponential”.

Value

[setOfIndividuals]

References

Eiben, A. E., & Smith, J. E. (2007). Introduction to evolutionary computing. Berlin: Springer.

See Also

Other selectors: selDomHV(), selGreedy(), selNondom(), selRoulette(), selSimple(), selTournament()


ecr documentation built on March 31, 2023, 10:07 p.m.