doNondominatedSorting

Fast non-dominated sorting algorithm proposed by Deb. Non-dominated sorting
expects a set of points and returns a
set of non-dominated fronts. In short words this is done as follows: the
non-dominated points of the entire set are determined and assigned rank 1.
Afterwards all points with the current rank are removed, the rank is increased
by one and the procedure starts again. This is done until the set is empty, i.~e.,
each point is assigned a rank.

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

doNondominatedSorting function

<dl><dt>x</dt>
<dd>[<code>matrix</code>] 
Numeric matrix of points. Each column contains one point.</dd></dl>

Arguments

Fast non-dominated sorting algorithm. — doNondominatedSorting

<dl>

<dt>x</dt>
<dd>[<code>matrix</code>] 
Numeric matrix of points. Each column contains one point.</dd>

</dl>

doNondominatedSorting: Fast non-dominated sorting algorithm.

Description

Usage

Value

Arguments

References