2d3587c1ee
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@656 331e1502-861f-0410-8da2-ba01fb791d7f
113 lines
4 KiB
C++
113 lines
4 KiB
C++
/*
|
|
* <moeoNormalizedSolutionVsSolutionBinaryMetric.h>
|
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
|
|
* (C) OPAC Team, LIFL, 2002-2007
|
|
*
|
|
* Arnaud Liefooghe
|
|
*
|
|
* This software is governed by the CeCILL license under French law and
|
|
* abiding by the rules of distribution of free software. You can use,
|
|
* modify and/ or redistribute the software under the terms of the CeCILL
|
|
* license as circulated by CEA, CNRS and INRIA at the following URL
|
|
* "http://www.cecill.info".
|
|
*
|
|
* As a counterpart to the access to the source code and rights to copy,
|
|
* modify and redistribute granted by the license, users are provided only
|
|
* with a limited warranty and the software's author, the holder of the
|
|
* economic rights, and the successive licensors have only limited liability.
|
|
*
|
|
* In this respect, the user's attention is drawn to the risks associated
|
|
* with loading, using, modifying and/or developing or reproducing the
|
|
* software by the user in light of its specific status of free software,
|
|
* that may mean that it is complicated to manipulate, and that also
|
|
* therefore means that it is reserved for developers and experienced
|
|
* professionals having in-depth computer knowledge. Users are therefore
|
|
* encouraged to load and test the software's suitability as regards their
|
|
* requirements in conditions enabling the security of their systems and/or
|
|
* data to be ensured and, more generally, to use and operate it in the
|
|
* same conditions as regards security.
|
|
* The fact that you are presently reading this means that you have had
|
|
* knowledge of the CeCILL license and that you accept its terms.
|
|
*
|
|
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
|
* Contact: paradiseo-help@lists.gforge.inria.fr
|
|
*
|
|
*/
|
|
//-----------------------------------------------------------------------------
|
|
|
|
#ifndef MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_
|
|
#define MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_
|
|
|
|
#include <vector>
|
|
#include <utils/eoRealBounds.h>
|
|
#include <metric/moeoMetric.h>
|
|
|
|
/**
|
|
* Base class for binary metrics dedicated to the performance comparison between two solutions's objective vectors using normalized values.
|
|
* Then, indicator values lie in the interval [-1,1].
|
|
* Note that you have to set the bounds for every objective before using the operator().
|
|
*/
|
|
template < class ObjectiveVector, class R >
|
|
class moeoNormalizedSolutionVsSolutionBinaryMetric : public moeoSolutionVsSolutionBinaryMetric < ObjectiveVector, R >
|
|
{
|
|
public:
|
|
|
|
/**
|
|
* Default ctr for any moeoNormalizedSolutionVsSolutionBinaryMetric object
|
|
*/
|
|
moeoNormalizedSolutionVsSolutionBinaryMetric()
|
|
{
|
|
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);
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* 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
|
|
*/
|
|
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;
|
|
}
|
|
|
|
|
|
/**
|
|
* 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;
|
|
}
|
|
|
|
|
|
protected:
|
|
|
|
/** the bounds for every objective (bounds[i] = bounds for the objective i) */
|
|
std::vector < eoRealInterval > bounds;
|
|
|
|
};
|
|
|
|
#endif /*MOEONORMALIZEDSOLUTIONVSSOLUTIONBINARYMETRIC_H_*/
|