The class 'nsga3' is a simple class union (setClassUnion())
of 'numeric', 'logical' and 'matrix'.
callan object of class 'call' representing the matched call.
typea character string specifying the type of genetic algorithm used.
lowera vector providing for each decision variable the lower bounds of the search space in case of real-valued or permutation encoded optimisations. Formerly this slot was named min.
uppera vector providing for each decision variable the upper bounds of the search space in case of real-valued or permutation encoded optimizations. Formerly this slot was named max.
nBitsa value specifying the number of bits to be used in binary encoded optimizations.
namesa vector of character strings providing the names of decision variables (optional).
popSizethe population size.
frontRange in which the individual is in the front generated by the
function (non_dominated_fronts())
fFronts generated by the function (non_dominated_fronts())
iterthe actual (or final) iteration of NSGA search.
runthe number of consecutive generations without any improvement in the best fitness value before the NSGA is stopped.
maxiterthe maximum number of iterations to run before the NSGA search is halted.
suggestionsa matrix of user provided solutions and included in the initial population.
populationthe current (or final) population.
ideal_pointNadir point estimate used as lower bound in normalization.
worst_pointWorst point generated over generations.
sminIndex used to obtain the extreme points.
extreme_pointsare selected using the ASF in the (PerformScalarizing()).
Necessary in the nadir point generation.
worst_of_populationThe worst individuals generated by objectives in the current generation.
worst_of_frontThe worst individuals in the first front generated by objectives in the current generation.
nadir_pointNadir point estimate used as upper bound in normalization.
pcrossoverthe crossover probability.
pmutationthe mutation probability.
reference_pointsNSGA-III uses a predefined set of reference points to ensure diversity in obtained solutions. The chosen refenrece points can be predefined in structured manner or supplied by the user. We use the Das and Dennis procedure.
fitnessthe values of fitness function for the current (or final) population
summarya matrix of summary statistics for fitness values at each iteration (along the rows).
fitnessValuethe best fitness value at the final iteration.
solutionthe value(s) of the decision variables giving the best fitness at the final iteration.
Since it is a virtual Class, no objects may be created from it.
# NOT RUN {
showClass('nsga3')
# }
Run the code above in your browser using DataLab