dominated

nondominated

These functions take a numeric matrix <code>x</code> where each column corresponds to
a point and return a logical vector. The i-th position of the latter is
<code>TRUE</code> if the i-th point is dominated by at least one other point for
<code>dominated</code> and <code>FALSE</code> for <code>nonDominated</code>.

optimize

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

dominated function

<dl><dt>x</dt>
<dd>[<code>matrix</code>] 
Numeric (d x n) matrix where d is the number of objectives and n is the
number of points.</dd></dl>

Arguments

Check for pareto dominance. — dominated

<dl>

<dt>x</dt>
<dd>[<code>matrix</code>] 
Numeric (d x n) matrix where d is the number of objectives and n is the
number of points.</dd>

</dl>

Check for pareto dominance.

dominated: Check for pareto dominance.

Description

Usage

Value

Arguments