Skip to main content
. 2018 Sep 7;20(9):684. doi: 10.3390/e20090684
Algorithm 7 Self-adaptive crossover.
Require:I, J {Individuals for crossing}
Require: pv (0<pv<1) {Probability of variation}
Require: δ>0 {Number of different crossover operators}
  •  1:

    if a random Bernoulli variable with probability pv takes the value 1 then

  •  2:

    dIRandom(0,δ)

  •  3:

    end if

  •  4:

    dJdI

  •  5:

    Carry out the type of crossover specified by dI:

    {0: No cross}

    {1: Rule crossover}

    {2: Rule incremental crossover}