792849c8bd
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@374 331e1502-861f-0410-8da2-ba01fb791d7f
112 lines
3.2 KiB
C++
112 lines
3.2 KiB
C++
// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
|
|
|
|
//-----------------------------------------------------------------------------
|
|
// moeoNormalizedDistance.h
|
|
// (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007
|
|
/*
|
|
This library...
|
|
|
|
Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr
|
|
*/
|
|
//-----------------------------------------------------------------------------
|
|
|
|
#ifndef MOEONORMALIZEDDISTANCE_H_
|
|
#define MOEONORMALIZEDDISTANCE_H_
|
|
|
|
#include <vector>
|
|
#include <utils/eoRealBounds.h>
|
|
#include <distance/moeoDistance.h>
|
|
|
|
/**
|
|
* The base class for double distance computation with normalized objective values (i.e. between 0 and 1).
|
|
*/
|
|
template < class MOEOT , class Type = double >
|
|
class moeoNormalizedDistance : public moeoDistance < MOEOT , Type >
|
|
{
|
|
public:
|
|
|
|
/** the objective vector type of the solutions */
|
|
typedef typename MOEOT::ObjectiveVector ObjectiveVector;
|
|
|
|
|
|
/**
|
|
* Default ctr
|
|
*/
|
|
moeoNormalizedDistance()
|
|
{
|
|
bounds.resize(ObjectiveVector::Traits::nObjectives());
|
|
// initialize bounds in case someone does not want to use them
|
|
for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
|
|
{
|
|
bounds[i] = eoRealInterval(0,1);
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* Returns a very small value that can be used to avoid extreme cases (where the min bound == the max bound)
|
|
*/
|
|
static double tiny()
|
|
{
|
|
return 1e-6;
|
|
}
|
|
|
|
|
|
/**
|
|
* Sets the lower and the upper bounds for every objective using extremes values for solutions contained in the population _pop
|
|
* @param _pop the population
|
|
*/
|
|
virtual void setup(const eoPop < MOEOT > & _pop)
|
|
{
|
|
double min, max;
|
|
for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
|
|
{
|
|
min = _pop[0].objectiveVector()[i];
|
|
max = _pop[0].objectiveVector()[i];
|
|
for (unsigned int j=1; j<_pop.size(); j++)
|
|
{
|
|
min = std::min(min, _pop[j].objectiveVector()[i]);
|
|
max = std::max(max, _pop[j].objectiveVector()[i]);
|
|
}
|
|
// setting of the bounds for the objective i
|
|
setup(min, max, i);
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* Sets the lower bound (_min) and the upper bound (_max) for the objective _obj
|
|
* @param _min lower bound
|
|
* @param _max upper bound
|
|
* @param _obj the objective index
|
|
*/
|
|
virtual void setup(double _min, double _max, unsigned int _obj)
|
|
{
|
|
if (_min == _max)
|
|
{
|
|
_min -= tiny();
|
|
_max += tiny();
|
|
}
|
|
bounds[_obj] = eoRealInterval(_min, _max);
|
|
}
|
|
|
|
|
|
/**
|
|
* Sets the lower bound and the upper bound for the objective _obj using a eoRealInterval object
|
|
* @param _realInterval the eoRealInterval object
|
|
* @param _obj the objective index
|
|
*/
|
|
virtual void setup(eoRealInterval _realInterval, unsigned int _obj)
|
|
{
|
|
bounds[_obj] = _realInterval;
|
|
}
|
|
|
|
|
|
protected:
|
|
|
|
/** the bounds for every objective (bounds[i] = bounds for the objective i) */
|
|
std::vector < eoRealInterval > bounds;
|
|
|
|
};
|
|
|
|
#endif /*MOEONORMALIZEDDISTANCE_H_*/
|