fastNonDominatedSorting: Fast Non-dominated Sorting
In nsga2R: Elitist Non-Dominated Sorting Genetic Algorithm

View source: R/fastNonDominatedSorting.R

fastNonDominatedSorting

R Documentation

Fast Non-dominated Sorting

Description

A fast approach to sort non-dominated solutions into different nondomination levels.

Usage

fastNonDominatedSorting(inputData)

Arguments

inputData

Matrix of solutions with objective function values

Value

Return a list of indices for all fronts.

Author(s)

Ching-Shih (Vince) Tsou cstsou@mail.ntcb.edu.tw

References

Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. (2002), " A fast and elitist multiobjective genetic algorithm: NSGA-II", IEEE Transactions on Evolutionary Computation, 6(2), 182-197.

Examples

set.seed(1234)
# randomly generate a polulation of fifty chromosomes, each with two objectives
y <- matrix(runif(100, -5, 5), nrow=50, ncol=2)
rankIdxList <- fastNonDominatedSorting(y)
rankIdxList

nsga2R documentation built on May 23, 2022, 5:06 p.m.