recOX

This recombination operator is specifically designed for permutations.
The operators chooses two cut-points at random and generates two offspring
as follows: a) copy the subsequence of one parent and b) remove the copied
node indizes from the entire sequence of the second parent from the sescond
cut point and b) fill the remaining gaps with this trimmed sequence.

Framework for building evolutionary algorithms for both single- and multi-objective continuous or discrete optimization problems. A set of predefined evolutionary building blocks and operators is included. Moreover, the user can easily set up custom objective functions, operators, building blocks and representations sticking to few conventions. The package allows both a black-box approach for standard tasks (plug-and-play style) and a much more flexible white-box approach where the evolutionary cycle is written by hand.

Jakob Bossek

Evolutionary Computation in R

Michael H. Buselli

Wessel Dankers

Carlos M. Fonseca

Manuel Lopez-Ibanez

Luis Paquete

Joshua Knowles

Eckart Zitzler

Olaf Mersmann

recOX function

<dl><dt>inds</dt>
<dd>[<code>list</code>] 
Parents, i.e., list of exactly two permutations (vectors of integer values) of equal length.</dd></dl>

Arguments

Ordered-Crossover (OX) recombinator. — recOX

<dl>

<dt>inds</dt>
<dd>[<code>list</code>] 
Parents, i.e., list of exactly two permutations (vectors of integer values) of equal length.</dd>

</dl>

recOX: Ordered-Crossover (OX) recombinator.

Description

Usage

Value

Arguments

See Also