DTLZ6 Class Reference

multi-objective problem DTLZ6 More...

#include <MultiObjectiveFunctions.h>

Inheritance diagram for DTLZ6:

ObjectiveFunctionVS< double > ObjectiveFunctionT< T * > ObjectiveFunction

List of all members.

Public Member Functions

 DTLZ6 (unsigned d=30, unsigned m=3)
 Constructor.
 ~DTLZ6 ()
 Destructor.
unsigned int objectives () const
 return the number of objectives to optimize
void result (double *const &point, std::vector< double > &value)
bool ProposeStartingPoint (double *&point) const
bool utopianFitness (std::vector< double > &value) const
 If possible, this method returns (a bound on) the best possible fitness.
bool nadirFitness (std::vector< double > &value) const
 If possible, this method returns (a bound on) the worst possible fitness.

Protected Attributes

unsigned m_objectives

Detailed Description

multi-objective problem DTLZ6

\[ f_1(x) = (1+g(X_m))*\cos(\phi_1* \pi / 2) \ldots cos(\phi_{m-1}*\pi /2) \]

\[ f_2(x) = (1+g(X_m))*\cos(\phi_1* \pi / 2) \ldots sin(\phi_{m-1}*\pi /2)) \]

$ \ldots $

\[ f_m(x) = (1+g(X_m))*\sin(\phi_1* \pi / 2) \]

where

\[ g(X_m)= \sum_{x_i \in X_m}x_i^{0,1} \]

$ \phi_i = \frac{\pi}{4(1+g(X_m))}*(1+2g(X_m)x_i) $

\[ x= (x_1, \ldots,x_n) \in [0,1]^{n} \]

$ m \leq n $ and usually $n = 30$

Definition at line 1982 of file MultiObjectiveFunctions.h.

Constructor & Destructor Documentation

DTLZ6::DTLZ6 ( unsigned  d = 30,
unsigned  m = 3 
)

Constructor.

Definition at line 3371 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunction::m_name, and m_objectives.

DTLZ6::~DTLZ6 (  ) 

Destructor.

Definition at line 3377 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionT< T * >::constrainthandler.

Member Function Documentation

bool DTLZ6::nadirFitness ( std::vector< double > &  value  )  const [virtual]

If possible, this method returns (a bound on) the worst possible fitness.

For single objective optimization this information is rarely of any use, while for multi objective optimization a so-called nadir point is important for the computation of standard quality indicators like the hypervolume.

Parameters:
fitness component wise worst fitness
Returns:
true if a nadir point is known, false otherwise

Reimplemented from ObjectiveFunctionVS< double >.

Definition at line 3442 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionVS< double >::m_dimension, and m_objectives.

unsigned int DTLZ6::objectives (  )  const [virtual]

return the number of objectives to optimize

Implements ObjectiveFunction.

Definition at line 3383 of file MultiObjectiveFunctions.cpp.

References m_objectives.

bool DTLZ6::ProposeStartingPoint ( double *&  point  )  const

Definition at line 3428 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionVS< double >::m_dimension.

void DTLZ6::result ( double *const &  point,
std::vector< double > &  value 
)

Definition at line 3388 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionVS< double >::m_dimension, m_objectives, and ObjectiveFunction::m_timesCalled.

bool DTLZ6::utopianFitness ( std::vector< double > &  value  )  const [virtual]

If possible, this method returns (a bound on) the best possible fitness.

For the single objective case the function should return the fitness in the global optimum. For the multi objective case this function should return a utopian point.

Parameters:
fitness component wise utopian fitness
Returns:
true if an utopian point is known, false otherwise

Reimplemented from ObjectiveFunctionVS< double >.

Definition at line 3437 of file MultiObjectiveFunctions.cpp.

Member Data Documentation

unsigned DTLZ6::m_objectives [protected]

Definition at line 1997 of file MultiObjectiveFunctions.h.

Referenced by DTLZ6(), nadirFitness(), objectives(), and result().

The documentation for this class was generated from the following files: