doNondominatedSorting

[<code>matrix</code>]
Numeric matrix of points. Each row contains one objective vector.


Pure R implementation of the 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.


Provides a powerful framework for evolutionary
computing in R. The user can easily construct powerful evolutionary algorithms
for tackling both single- and multi-objective problems by plugging in different
predefined evolutionary building blocks, e. g., operators for mutation,
recombination and selection with just a few lines of code. Your problem
cannot be easily solved with a standard EA which works on real-valued vectors,
permutations or binary strings? No problem, 'ecr' has been developed with that in
mind. Extending the framework with own operators is also possible. Additionally
there are various comfort functions, like monitoring, logging and more.

doNondominatedSorting: Fast non-dominated sorting algorithm.

Description

Usage

Arguments

Value

References