Opened 13 years ago
Last modified 13 years ago
#1496 closed feature request
Implement generalized rank selection operator — at Initial Version
Reported by: | abeham | Owned by: | swagner |
---|---|---|---|
Priority: | high | Milestone: | HeuristicLab 3.3.5 |
Component: | Selection | Version: | 3.3.5 |
Keywords: | Cc: |
Description
I just read about a generalized rank selection operator which allows a stepless variation of the selection pressure and that is based on the idea of rank selection.
The operator is described in Tate1995 as follows: "Instead, we selected parent strings by choosing a uniform random number between 1 and sqrt(m) (where m is the population size), then squaring it. The result was truncated and taken to be the rank of the selected parent (where string zero is the fittest string in the population). This approach can be generalized to give an arbitrary degree of preference or even varied dynamically during a given run by changing the power of the root of m during subsequent generations."