mutation
fun mutationPolynomialBounded(value: DoubleArray, eta: Double, low: Double, up: Double, chance: Double, random: Random)
Polynomial mutation as implemented in original NSGA-II algorithm in C by Deb. This mutation expects Chromosome.value of floating point numbers.
Parameters
value
chromosome to be mutated
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
the probability of each attribute to be mutated