mutUniformPruefer: Uniform mutation for Pruefer code representation.
In jakobbossek/rmoco: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem
mutUniformPruefer R Documentation
Uniform mutation for Pruefer code representation.
Description
mutUniformPruefer replaces each component of a Pruefer code of length n - 2
with probability p with a random node number between 1 and n.
Usage
mutUniformPruefer(ind, p = 1/length(ind))
Arguments
ind
[integer]
Pruefer code.
p
[numeric(1)]
Probability of mutation of each component of ind.
Default is 1 / length(ind).
Value
[integer] Mutated Pruefer code.
See Also
Evolutionary multi-objective algorithm mcMSTEmoaZhou
Other mcMST EMOA mutators:
mutEdgeExchange(),
mutKEdgeExchange(),
mutSubforestMST(),
mutSubgraphMST()
jakobbossek/rmoco documentation built on March 21, 2023, 9:09 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| mutUniformPruefer | R Documentation |
Uniform mutation for Pruefer code representation.
Description
mutUniformPruefer replaces each component of a Pruefer code of length n - 2
with probability p with a random node number between 1 and n.
Usage
mutUniformPruefer(ind, p = 1/length(ind))
Arguments
ind |
[ |
p |
[ |
Value
[integer] Mutated Pruefer code.
See Also
Evolutionary multi-objective algorithm mcMSTEmoaZhou
Other mcMST EMOA mutators:
mutEdgeExchange(),
mutKEdgeExchange(),
mutSubforestMST(),
mutSubgraphMST()
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.