mut
fun <F> CellEvolveScope<DoubleArray, F>.mutPolynomialBounded(eta: Double, low: Double, up: Double, chance: Double, polynomialBoundedChance: Double)
Polynomial mutation as implemented in original NSGA-II algorithm in C by Deb. This mutation expects Chromosome.value of floating point numbers.
Parameters
eta
crowding degree of the mutation. A high eta will produce a mutant resembling its parent, while a small eta will produce a solution much more different.
low
A value that is the lower bound of the search space.
up
A value that is the upper bound of the search space.
chance
chance of mutation between a pair of chromosomes
polynomial
the probability of each attribute to be mutated