fastNonDominatedSorting: Fast Non-dominated Sorting

Description Usage Arguments Value Author(s) References Examples

View source: R/fastNonDominatedSorting.R

Description

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

Usage

1

Arguments

inputData

Matrix of solutions with objective function values

Value

Return a list of indices for all fronts.

Author(s)

Ching-Shih (Vince) Tsou [email protected]

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

1
2
3
4
5
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

Example output

Loading required package: mco
[[1]]
[1]  1  7 14 23

[[2]]
[1] 19 24 30 35 48

[[3]]
[1] 12 25 37

[[4]]
[1] 15 17 20 21 28 33 43 45 49

[[5]]
[1]  8 38 41 44

[[6]]
[1]  2  5  9 13 32

[[7]]
[1] 18 27 39 47

[[8]]
[1]  4  6 22 29 46

[[9]]
[1] 26 31 34

[[10]]
[1]  3 10 16

[[11]]
[1] 11 42 50

[[12]]
[1] 36 40

nsga2R documentation built on May 29, 2017, 8:02 p.m.