Description Usage Arguments Value Note References
The NSGA-II merges the current population and the generated offspring and reduces it by means of the following procedure: It first applies the non dominated sorting algorithm to obtain the nondominated fronts. Starting with the first front, it fills the new population until the i-th front does not fit. It then applies the secondary crowding distance criterion to select the missing individuals from the i-th front.
1 2 3 4 | nsga2(task, n.population = 100L, n.offspring = n.population,
parent.selector = setupSimpleSelector(), mutator = setupGaussMutator(),
recombinator = setupCrossoverRecombinator(), max.iter = 100L,
max.evals = NULL, max.time = NULL, ...)
|
task |
[ |
n.population |
[ |
n.offspring |
[ |
parent.selector |
[ |
mutator |
[ |
recombinator |
[ |
max.iter |
[ |
max.evals |
[ |
max.time |
[ |
... |
[any] |
[ecr_nsga2_result, ecr_multi_objective_result
]
This is a pure R implementation of the NSGA-II algorithm. It hides the regular ecr interface and offers a more R like interface while still being quite adaptable.
Deb, K., Pratap, A., and Agarwal, S. A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6 (8) (2002), 182-197.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.