trick to allow maximization
This commit is contained in:
Arnaud Liefooghe
parent
b6b5cd6e2f
commit
5a74f9a3c6
1 changed files with 93 additions and 90 deletions
|
|
@ -1,39 +1,39 @@
|
||||||
/*
|
/*
|
||||||
* <moeoHypervolumeBinaryMetric.h>
|
* <moeoHypervolumeBinaryMetric.h>
|
||||||
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
|
||||||
* (C) OPAC Team, LIFL, 2002-2007
|
* (C) OPAC Team, LIFL, 2002-2007
|
||||||
*
|
*
|
||||||
* July 2013: Bug fix in the recursive call of hypervolume (corrected thanks to Yann Semet and Dimo Brockhoff)
|
* July 2013: Bug fix in the recursive call of hypervolume (corrected thanks to Yann Semet and Dimo Brockhoff)
|
||||||
*
|
*
|
||||||
*
|
*
|
||||||
* This software is governed by the CeCILL license under French law and
|
* This software is governed by the CeCILL license under French law and
|
||||||
* abiding by the rules of distribution of free software. You can use,
|
* abiding by the rules of distribution of free software. You can use,
|
||||||
* modify and/ or redistribute the software under the terms of the CeCILL
|
* modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
* license as circulated by CEA, CNRS and INRIA at the following URL
|
* license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
* "http://www.cecill.info".
|
* "http://www.cecill.info".
|
||||||
*
|
*
|
||||||
* As a counterpart to the access to the source code and rights to copy,
|
* 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
|
* modify and redistribute granted by the license, users are provided only
|
||||||
* with a limited warranty and the software's author, the holder of the
|
* with a limited warranty and the software's author, the holder of the
|
||||||
* economic rights, and the successive licensors have only limited liability.
|
* economic rights, and the successive licensors have only limited liability.
|
||||||
*
|
*
|
||||||
* In this respect, the user's attention is drawn to the risks associated
|
* In this respect, the user's attention is drawn to the risks associated
|
||||||
* with loading, using, modifying and/or developing or reproducing the
|
* with loading, using, modifying and/or developing or reproducing the
|
||||||
* software by the user in light of its specific status of free software,
|
* 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
|
* that may mean that it is complicated to manipulate, and that also
|
||||||
* therefore means that it is reserved for developers and experienced
|
* therefore means that it is reserved for developers and experienced
|
||||||
* professionals having in-depth computer knowledge. Users are therefore
|
* professionals having in-depth computer knowledge. Users are therefore
|
||||||
* encouraged to load and test the software's suitability as regards their
|
* encouraged to load and test the software's suitability as regards their
|
||||||
* requirements in conditions enabling the security of their systems and/or
|
* 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
|
* data to be ensured and, more generally, to use and operate it in the
|
||||||
* same conditions as regards security.
|
* same conditions as regards security.
|
||||||
* The fact that you are presently reading this means that you have had
|
* The fact that you are presently reading this means that you have had
|
||||||
* knowledge of the CeCILL license and that you accept its terms.
|
* knowledge of the CeCILL license and that you accept its terms.
|
||||||
*
|
*
|
||||||
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
* Contact: paradiseo-help@lists.gforge.inria.fr
|
* Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
*
|
*
|
||||||
*/
|
*/
|
||||||
//-----------------------------------------------------------------------------
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
#ifndef MOEOHYPERVOLUMEBINARYMETRIC_H_
|
#ifndef MOEOHYPERVOLUMEBINARYMETRIC_H_
|
||||||
|
|
@ -57,8 +57,8 @@
|
||||||
*/
|
*/
|
||||||
template < class ObjectiveVector >
|
template < class ObjectiveVector >
|
||||||
class moeoHypervolumeBinaryMetric : public moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double >
|
class moeoHypervolumeBinaryMetric : public moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double >
|
||||||
{
|
{
|
||||||
public:
|
public:
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Ctor
|
* Ctor
|
||||||
|
|
@ -66,19 +66,11 @@ class moeoHypervolumeBinaryMetric : public moeoNormalizedSolutionVsSolutionBinar
|
||||||
*/
|
*/
|
||||||
moeoHypervolumeBinaryMetric(double _rho = 1.1) : moeoNormalizedSolutionVsSolutionBinaryMetric<ObjectiveVector, double>(), rho(_rho)
|
moeoHypervolumeBinaryMetric(double _rho = 1.1) : moeoNormalizedSolutionVsSolutionBinaryMetric<ObjectiveVector, double>(), rho(_rho)
|
||||||
{
|
{
|
||||||
// not-a-maximization problem check
|
// consistency check
|
||||||
for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
|
if (rho < 1)
|
||||||
{
|
|
||||||
if (ObjectiveVector::Traits::maximizing(i))
|
|
||||||
{
|
|
||||||
throw std::runtime_error("Hypervolume binary metric not yet implemented for a maximization problem in moeoHypervolumeBinaryMetric");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
// consistency check
|
|
||||||
if (rho < 1)
|
|
||||||
{
|
{
|
||||||
eo::log << eo::warnings << "Warning, value used to compute the reference point rho for the hypervolume calculation must not be smaller than 1, adjusted to 1" << std::endl;
|
eo::log << eo::warnings << "Warning, value used to compute the reference point rho for the hypervolume calculation must not be smaller than 1, adjusted to 1" << std::endl;
|
||||||
rho = 1;
|
rho = 1;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
@ -91,21 +83,32 @@ class moeoHypervolumeBinaryMetric : public moeoNormalizedSolutionVsSolutionBinar
|
||||||
*/
|
*/
|
||||||
double operator()(const ObjectiveVector & _o1, const ObjectiveVector & _o2)
|
double operator()(const ObjectiveVector & _o1, const ObjectiveVector & _o2)
|
||||||
{
|
{
|
||||||
double result;
|
double result;
|
||||||
// if _o2 is dominated by _o1
|
// transform maximizing objectives into minimizing objectives
|
||||||
if ( paretoComparator(_o2,_o1) )
|
ObjectiveVector o1 = _o1;
|
||||||
|
ObjectiveVector o2 = _o2;
|
||||||
|
for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
|
||||||
{
|
{
|
||||||
result = - hypervolume(_o1, _o2, ObjectiveVector::Traits::nObjectives()-1);
|
if (ObjectiveVector::Traits::maximizing(i))
|
||||||
|
{
|
||||||
|
o1[i] = bounds[i].maximum() - o1[i] + bounds[i].minimum();
|
||||||
|
o2[i] = bounds[i].maximum() - o2[i] + bounds[i].minimum();
|
||||||
|
}
|
||||||
}
|
}
|
||||||
else
|
// if _o2 is dominated by _o1
|
||||||
|
if ( paretoComparator(_o2,_o1) )
|
||||||
{
|
{
|
||||||
result = hypervolume(_o2, _o1, ObjectiveVector::Traits::nObjectives()-1);
|
result = - hypervolume(_o1, _o2, ObjectiveVector::Traits::nObjectives()-1);
|
||||||
}
|
}
|
||||||
return result;
|
else
|
||||||
|
{
|
||||||
|
result = hypervolume(_o2, _o1, ObjectiveVector::Traits::nObjectives()-1);
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
private:
|
private:
|
||||||
|
|
||||||
/** value used to compute the reference point from the worst values for each objective */
|
/** value used to compute the reference point from the worst values for each objective */
|
||||||
double rho;
|
double rho;
|
||||||
|
|
@ -124,48 +127,48 @@ class moeoHypervolumeBinaryMetric : public moeoNormalizedSolutionVsSolutionBinar
|
||||||
*/
|
*/
|
||||||
double hypervolume(const ObjectiveVector & _o1, const ObjectiveVector & _o2, const unsigned int _obj, const bool _flag = false)
|
double hypervolume(const ObjectiveVector & _o1, const ObjectiveVector & _o2, const unsigned int _obj, const bool _flag = false)
|
||||||
{
|
{
|
||||||
double result;
|
double result;
|
||||||
double range = rho * bounds[_obj].range();
|
double range = rho * bounds[_obj].range();
|
||||||
double max = bounds[_obj].minimum() + range;
|
double max = bounds[_obj].minimum() + range;
|
||||||
|
|
||||||
// value of _1 for the objective _obj
|
// value of _1 for the objective _obj
|
||||||
double v1 = _o1[_obj];
|
double v1 = _o1[_obj];
|
||||||
// value of _2 for the objective _obj (if _flag=true, v2=max)
|
// value of _2 for the objective _obj (if _flag=true, v2=max)
|
||||||
double v2;
|
double v2;
|
||||||
if (_flag)
|
if (_flag)
|
||||||
{
|
{
|
||||||
v2 = max;
|
v2 = max;
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
v2 = _o2[_obj];
|
v2 = _o2[_obj];
|
||||||
}
|
}
|
||||||
// computation of the volume
|
// computation of the volume
|
||||||
if (_obj == 0)
|
if (_obj == 0)
|
||||||
{
|
{
|
||||||
if (v1 < v2)
|
if (v1 < v2)
|
||||||
{
|
{
|
||||||
result = (v2 - v1) / range;
|
result = (v2 - v1) / range;
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
result = 0;
|
result = 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
if (v1 < v2)
|
if (v1 < v2)
|
||||||
{
|
{
|
||||||
result = ( hypervolume(_o1, _o2, _obj-1, true) * (v2 - v1) / range ) + ( hypervolume(_o1, _o2, _obj-1) * (max - v2) / range );
|
result = ( hypervolume(_o1, _o2, _obj-1, true) * (v2 - v1) / range ) + ( hypervolume(_o1, _o2, _obj-1) * (max - v2) / range );
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
result = hypervolume(_o1, _o2, _obj-1) * (max - v1) / range;
|
result = hypervolume(_o1, _o2, _obj-1) * (max - v1) / range;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
#endif /*MOEOHYPERVOLUMEBINARYMETRIC_H_*/
|
#endif /*MOEOHYPERVOLUMEBINARYMETRIC_H_*/
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue