ZDT1 Class Reference

multi-objective problem ZDT1 More...

#include <MultiObjectiveFunctions.h>

Inheritance diagram for ZDT1:

List of all members.

Public Member Functions

ZDT1 (unsigned d)

Constructor.

~ZDT1 ()

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 ZDT1

$f_{1}(x)=x_1$

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

where

$g(x)=1+\frac{9}{n-1} \sum_{i=2}^{n} x_i ^2$

$0 \leq x_i \leq 1$

Definition at line 160 of file MultiObjectiveFunctions.h.

Constructor & Destructor Documentation

ZDT1::ZDT1 ( unsigned d )

Constructor.

Definition at line 163 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunction::m_name.

ZDT1::~ZDT1 ( )

Destructor.

Definition at line 168 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionT< T * >::constrainthandler.

Member Function Documentation

bool ZDT1::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 215 of file MultiObjectiveFunctions.cpp.

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

return the number of objectives to optimize

Implements ObjectiveFunction.

Definition at line 175 of file MultiObjectiveFunctions.cpp.

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

Definition at line 201 of file MultiObjectiveFunctions.cpp.

References ObjectiveFunctionVS< double >::m_dimension.

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

Definition at line 180 of file MultiObjectiveFunctions.cpp.

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

bool ZDT1::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 210 of file MultiObjectiveFunctions.cpp.

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


Public Member Functions
	ZDT1 (unsigned d)
	Constructor.
	~ZDT1 ()
	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.