shark::BaseFastNonDominatedSort< Extractor > Struct Template Reference

Implements the well-known non-dominated sorting algorithm. More...

#include <shark/Algorithms/DirectSearch/FastNonDominatedSort.h>

Public Member Functions

template<typename PopulationType >
void operator() (PopulationType &pop)
 Executes the algorithm. More...
 

Detailed Description

template<typename Extractor>
struct shark::BaseFastNonDominatedSort< Extractor >

Implements the well-known non-dominated sorting algorithm.

Assembles subsets/fronts of mututally non-dominating individuals. Afterwards every individual is assigned a rank by pop[i].rank() = fronNumber. The front of dominating points has the value 1.

The algorithm is dscribed in Deb et al, A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II IEEE Transactions on Evolutionary Computation, 2002

Template Parameters
Extractorreturning the fitness vector of an individual

Definition at line 51 of file FastNonDominatedSort.h.

Member Function Documentation

§ operator()()

template<typename Extractor >
template<typename PopulationType >
void shark::BaseFastNonDominatedSort< Extractor >::operator() ( PopulationType &  pop)
inline

Executes the algorithm.

Afterwards every individual is assigned a rank by pop[i].rank() = fronNumber. The front of dominating points has the value 1.

Parameters
pop[in,out] Population to subdivide into fronts of non-dominated individuals.

Definition at line 62 of file FastNonDominatedSort.h.


The documentation for this struct was generated from the following file: