ZZJ07_F9 Class Reference

multi-objective problem ZZJ07_F9 More...

#include <MultiObjectiveFunctions.h>

Inheritance diagram for ZZJ07_F9:

ObjectiveFunctionVS< double > ObjectiveFunctionT< T * > ObjectiveFunction

List of all members.

Public Member Functions

 ZZJ07_F9 (unsigned d=10)
 Constructor.
 ~ZZJ07_F9 ()
 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.

Detailed Description

multi-objective problem ZZJ07_F9

Multi objective problem with quadratic Pareto Set shape. The ZZJ07_F9 problem is given by:

\[ f_{1}(x)=x_1 \]

\[ f_{2}(x)=g(x)(1- \sqrt{\frac{x_1}{g(x)}}) \]

where

\[ g(x) = \frac{1}{4000}\sum_{i=2}^{n}(x_{i}^{2}-x_{1})^{2}-\prod_{i=2}^{n}cos(\frac{x_{i}^{2}-x_{1}}{\sqrt{i-1}}) +2 \]

\[ x\in [0,1]\times [0,10]^{n-1} \]

and usually $ n=10 $

Definition at line 1011 of file MultiObjectiveFunctions.h.

Constructor & Destructor Documentation

ZZJ07_F9::ZZJ07_F9 ( unsigned  d = 10  ) 

Constructor.

Definition at line 1636 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunction::m_name.

ZZJ07_F9::~ZZJ07_F9 (  ) 

Destructor.

Definition at line 1641 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionT< T * >::constrainthandler.

Member Function Documentation

bool ZZJ07_F9::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 1691 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionVS< double >::m_dimension.

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

return the number of objectives to optimize

Implements ObjectiveFunction.

Definition at line 1648 of file MultiObjectiveFunctions.cpp.

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

Definition at line 1676 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionVS< double >::m_dimension.

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

Definition at line 1653 of file MultiObjectiveFunctions.cpp.

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

bool ZZJ07_F9::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 1686 of file MultiObjectiveFunctions.cpp.

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