Uniform mutation

Each point is replaced (with probability pm) by a point placed uniformly at random in the Euclidean sub-space \([0,1]^2\).

doUniformMutation(coords, pm = 0.1, ...)

Arguments

coords	[matrix] An n times 2 matrix of point coordinates in \([0, 1]^2\).
pm	[numeric(1)] Probability of node mutation. Note that each node is subject to mutation independent of the the nodes. Default is \(0.1\), i.e., in expectation 10% of the points are mutated.
...	[any] Currently not used.

Value

[matrix] Mutated coordinates.

References

Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., & Neumann, F. (2012). Local search and the traveling salesman problem: A feature-based characterization of problem hardness. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7219 LNCS, 115-129.

See also

build

Other mutation operators: doAxisProjectionMutation, doClusterMutation, doCompressionMutation, doExpansionMutation, doExplosionMutation, doGridMutation, doImplosionMutation, doLinearProjectionMutation, doNormalMutation, doRotationMutation