shufmut: Shuffle Mutation

In adana: Adaptive Nature-Inspired Algorithms for Hybrid Genetic Optimization

Shuffle Mutation

Description

Shuffle Mutation works by randomly shuffling the values in a randomly selected subset of the chromosome (Syswerda, 1991).

This operator is used in problems with permutation encoding.

Usage

shufmut(y, ...)

Arguments

y	A vector. Chromosome of the offspring
...	Further arguments passed to or from other methods.

Value

mutant	A vector. Chromosome of the offspring
mutrange	A vector. The numbers of begining and ending of the mutated genes.

Author(s)

Zeynel Cebeci & Erkut Tekeli

References

Syswerda, G. (1991). Schedule optimization using genetic algorithms. Handbook of Genetic Algorithms.

See Also

mutate, bitmut, randmut, randmut2, randmut3, randmut4, unimut, boundmut, nunimut, nunimut2, powmut, powmut2, gaussmut, gaussmut2, gaussmut3, bsearchmut1, bsearchmut2, swapmut, invmut, insmut, dismut, invswapmut, insswapmut, invdismut

Examples

offspring = c(1, 2, 3, 4, 5, 6, 7, 8, 9)
shufmut(offspring)

adana documentation built on March 18, 2022, 6:03 p.m.