The Simulated Binary Crossover was first proposed by [1]. It i suited for float representation only and creates two offspring. Given parents \(p_1, p_2\) the offspring are generated as \(c_{1/2} = \bar{x} \pm \frac{1}{2}\beta(p_2 - p_1)\) where \(\bar{x} = \frac{1}{2}(p_1 + p_2), p_2 > p_1\). This way \(\bar{c} = \bar{x}\) is assured.
recSBX(inds, eta = 5, p = 1, lower, upper)
inds | [ |
---|---|
eta | [ |
p | [ |
lower | [ |
upper | [ |
[ecr_recombinator
]
This is the default recombination operator used in the NSGA-II EMOA (see nsga2
).
[1] Deb, K. and Agrawal, R. B. (1995). Simulated binary crossover for continuous search space. Complex Systems 9(2), 115-148.
Other recombinators: recCrossover
,
recIntermediate
, recOX
,
recPMX
, recUnifCrossover