mutEdgeExchange: One-edge-exchange mutator for edge list representation of...

Description Usage Arguments Value See Also

Description

Each edge is replaced with another feasible edge with probability p. By default p = 1/m where m is the number of edges, i.e., in expectation one edge is replaced. The operators maintains the spanning tree property, i.e., the resulting edge list is indeed the edge list of a spanning tree.

Usage

1
mutEdgeExchange(ind, p = 1/ncol(ind), instance = NULL)

Arguments

ind

[matrix(2, m)]
Matrix of edges (each column is one edge).

p

[numeric(1)]
Probability of edge exchange. Default is 1 / ncol(ind).

instance

[grapherator]
Multi-objective graph.

Value

[matrix(2, m)] Mutated edge list.

See Also

Evolutionary multi-objective algorithm mcMSTEmoaBG

Other mcMST EMOA mutators: mutKEdgeExchange, mutSubforestMST, mutSubgraphMST, mutUniformPruefer


jakobbossek/rmoco documentation built on May 10, 2018, 9:53 p.m.