weak, strict and epsilon dominance added
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1265 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
4f804ac318
commit
f999e44098
8 changed files with 673 additions and 2 deletions
|
|
@ -0,0 +1,94 @@
|
||||||
|
/*
|
||||||
|
* <moeoEpsilonObjectiveVectorComparator.h>
|
||||||
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
* (C) OPAC Team, LIFL, 2002-2008
|
||||||
|
*
|
||||||
|
* 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 MOEOEPSILONOBJECTIVEVECTORCOMPARATOR_H_
|
||||||
|
#define MOEOEPSILONOBJECTIVEVECTORCOMPARATOR_H_
|
||||||
|
|
||||||
|
#include <comparator/moeoObjectiveVectorComparator.h>
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This functor class allows to compare 2 objective vectors according to epsilon dominance.
|
||||||
|
*/
|
||||||
|
template < class ObjectiveVector >
|
||||||
|
class moeoEpsilonObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector >
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Ctor.
|
||||||
|
* @param _ref the reference point
|
||||||
|
*/
|
||||||
|
moeoEpsilonObjectiveVectorComparator(double _epsilon) : epsilon(_epsilon)
|
||||||
|
{}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Returns true if _objectiveVector1 is epsilon-dominated by _objectiveVector2
|
||||||
|
* @param _objectiveVector1 the first objective vector
|
||||||
|
* @param _objectiveVector2 the second objective vector
|
||||||
|
*/
|
||||||
|
const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)
|
||||||
|
{
|
||||||
|
for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++)
|
||||||
|
{
|
||||||
|
// _objectiveVector1[i] == _objectiveVector2[i] ?
|
||||||
|
if ( fabs((_objectiveVector1[i]/ epsilon) - _objectiveVector2[i]) > ObjectiveVector::Traits::tolerance() )
|
||||||
|
{
|
||||||
|
if (ObjectiveVector::minimizing(i))
|
||||||
|
{
|
||||||
|
if ((_objectiveVector1[i] / epsilon) <= _objectiveVector2[i])
|
||||||
|
{
|
||||||
|
return false; // _objectiveVector1[i] is not better than _objectiveVector2[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (ObjectiveVector::maximizing(i))
|
||||||
|
{
|
||||||
|
if ((_objectiveVector1[i] / epsilon) >= _objectiveVector2[i])
|
||||||
|
{
|
||||||
|
return false; // _objectiveVector1[i] is not better than _objectiveVector2[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
/** the reference point */
|
||||||
|
double epsilon;
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif /*MOEOEPSILONOBJECTIVEVECTORCOMPARATOR_H_*/
|
||||||
|
|
@ -0,0 +1,85 @@
|
||||||
|
/*
|
||||||
|
* <moeoStrictObjectiveVectorComparator.h>
|
||||||
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
* (C) OPAC Team, LIFL, 2002-2008
|
||||||
|
*
|
||||||
|
* 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 MOEOSTRICTOBJECTIVEVECTORCOMPARATOR_H_
|
||||||
|
#define MOEOSTRICTOBJECTIVEVECTORCOMPARATOR_H_
|
||||||
|
|
||||||
|
#include <comparator/moeoObjectiveVectorComparator.h>
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This functor class allows to compare 2 objective vectors according to strict dominance.
|
||||||
|
*/
|
||||||
|
template < class ObjectiveVector >
|
||||||
|
class moeoStrictObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector >
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Returns true if _objectiveVector1 is strictly dominated by _objectiveVector2
|
||||||
|
* @param _objectiveVector1 the first objective vector
|
||||||
|
* @param _objectiveVector2 the second objective vector
|
||||||
|
*/
|
||||||
|
const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)
|
||||||
|
{
|
||||||
|
for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++)
|
||||||
|
{
|
||||||
|
// _objectiveVector1[i] == _objectiveVector2[i] ?
|
||||||
|
if ( fabs(_objectiveVector1[i] - _objectiveVector2[i]) < ObjectiveVector::Traits::tolerance() )
|
||||||
|
{
|
||||||
|
return false; // _objectiveVector1[i] is not STRICTLY better than _objectiveVector2[i]
|
||||||
|
}
|
||||||
|
else if (ObjectiveVector::minimizing(i))
|
||||||
|
{
|
||||||
|
if (_objectiveVector1[i] < _objectiveVector2[i])
|
||||||
|
{
|
||||||
|
return false; // _objectiveVector1[i] is not better than _objectiveVector2[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (ObjectiveVector::maximizing(i))
|
||||||
|
{
|
||||||
|
if (_objectiveVector1[i] > _objectiveVector2[i])
|
||||||
|
{
|
||||||
|
return false; // _objectiveVector1[i] is not better than _objectiveVector2[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif /*MOEOSTRICTOBJECTIVEVECTORCOMPARATOR_H_*/
|
||||||
|
|
@ -0,0 +1,84 @@
|
||||||
|
/*
|
||||||
|
* <moeoWeakObjectiveVectorComparator.h>
|
||||||
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
* (C) OPAC Team, LIFL, 2002-2008
|
||||||
|
*
|
||||||
|
* 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 MOEOWEAKOBJECTIVEVECTORCOMPARATOR_H_
|
||||||
|
#define MOEOWEAKOBJECTIVEVECTORCOMPARATOR_H_
|
||||||
|
|
||||||
|
#include <comparator/moeoObjectiveVectorComparator.h>
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This functor class allows to compare 2 objective vectors according to weak dominance.
|
||||||
|
*/
|
||||||
|
template < class ObjectiveVector >
|
||||||
|
class moeoWeakObjectiveVectorComparator : public moeoObjectiveVectorComparator < ObjectiveVector >
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Returns true if _objectiveVector1 is weakly dominated by _objectiveVector2
|
||||||
|
* @param _objectiveVector1 the first objective vector
|
||||||
|
* @param _objectiveVector2 the second objective vector
|
||||||
|
*/
|
||||||
|
const bool operator()(const ObjectiveVector & _objectiveVector1, const ObjectiveVector & _objectiveVector2)
|
||||||
|
{
|
||||||
|
for (unsigned int i=0; i<ObjectiveVector::nObjectives(); i++)
|
||||||
|
{
|
||||||
|
// _objectiveVector1[i] == _objectiveVector2[i] ?
|
||||||
|
if ( fabs(_objectiveVector1[i] - _objectiveVector2[i]) > ObjectiveVector::Traits::tolerance() )
|
||||||
|
{
|
||||||
|
if (ObjectiveVector::minimizing(i))
|
||||||
|
{
|
||||||
|
if (_objectiveVector1[i] < _objectiveVector2[i])
|
||||||
|
{
|
||||||
|
return false; // _objectiveVector1[i] is not better than _objectiveVector2[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (ObjectiveVector::maximizing(i))
|
||||||
|
{
|
||||||
|
if (_objectiveVector1[i] > _objectiveVector2[i])
|
||||||
|
{
|
||||||
|
return false; // _objectiveVector1[i] is not better than _objectiveVector2[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif /*MOEOWEAKOBJECTIVEVECTORCOMPARATOR_H_*/
|
||||||
|
|
@ -58,16 +58,18 @@
|
||||||
#include <archive/moeoSPEA2Archive.h>
|
#include <archive/moeoSPEA2Archive.h>
|
||||||
#include <archive/moeoBoundedArchive.h>
|
#include <archive/moeoBoundedArchive.h>
|
||||||
|
|
||||||
|
|
||||||
#include <comparator/moeoAggregativeComparator.h>
|
#include <comparator/moeoAggregativeComparator.h>
|
||||||
#include <comparator/moeoComparator.h>
|
#include <comparator/moeoComparator.h>
|
||||||
#include <comparator/moeoDiversityThenFitnessComparator.h>
|
#include <comparator/moeoDiversityThenFitnessComparator.h>
|
||||||
|
#include <comparator/moeoEpsilonObjectiveVectorComparator.h>
|
||||||
#include <comparator/moeoFitnessThenDiversityComparator.h>
|
#include <comparator/moeoFitnessThenDiversityComparator.h>
|
||||||
#include <comparator/moeoGDominanceObjectiveVectorComparator.h>
|
#include <comparator/moeoGDominanceObjectiveVectorComparator.h>
|
||||||
#include <comparator/moeoObjectiveVectorComparator.h>
|
#include <comparator/moeoObjectiveVectorComparator.h>
|
||||||
#include <comparator/moeoObjectiveObjectiveVectorComparator.h>
|
#include <comparator/moeoObjectiveObjectiveVectorComparator.h>
|
||||||
#include <comparator/moeoOneObjectiveComparator.h>
|
#include <comparator/moeoOneObjectiveComparator.h>
|
||||||
#include <comparator/moeoParetoObjectiveVectorComparator.h>
|
#include <comparator/moeoParetoObjectiveVectorComparator.h>
|
||||||
|
#include <comparator/moeoStrictObjectiveVectorComparator.h>
|
||||||
|
#include <comparator/moeoWeakObjectiveVectorComparator.h>
|
||||||
|
|
||||||
#include <core/MOEO.h>
|
#include <core/MOEO.h>
|
||||||
#include <core/moeoBitVector.h>
|
#include <core/moeoBitVector.h>
|
||||||
|
|
@ -120,7 +122,6 @@
|
||||||
#include <metric/moeoHyperVolumeMetric.h>
|
#include <metric/moeoHyperVolumeMetric.h>
|
||||||
#include <metric/moeoHyperVolumeDifferenceMetric.h>
|
#include <metric/moeoHyperVolumeDifferenceMetric.h>
|
||||||
|
|
||||||
|
|
||||||
#include <replacement/moeoElitistReplacement.h>
|
#include <replacement/moeoElitistReplacement.h>
|
||||||
#include <replacement/moeoEnvironmentalReplacement.h>
|
#include <replacement/moeoEnvironmentalReplacement.h>
|
||||||
#include <replacement/moeoGenerationalReplacement.h>
|
#include <replacement/moeoGenerationalReplacement.h>
|
||||||
|
|
|
||||||
|
|
@ -36,6 +36,9 @@ SET (TEST_LIST
|
||||||
t-moeoRealVector
|
t-moeoRealVector
|
||||||
t-moeoUnboundedArchive
|
t-moeoUnboundedArchive
|
||||||
t-moeoParetoObjectiveVectorComparator
|
t-moeoParetoObjectiveVectorComparator
|
||||||
|
t-moeoStrictObjectiveVectorComparator
|
||||||
|
t-moeoWeakObjectiveVectorComparator
|
||||||
|
t-moeoEpsilonObjectiveVectorComparator
|
||||||
t-moeoAggregativeComparator
|
t-moeoAggregativeComparator
|
||||||
t-moeoDiversityThenFitnessComparator
|
t-moeoDiversityThenFitnessComparator
|
||||||
t-moeoFitnessThenDiversityComparator
|
t-moeoFitnessThenDiversityComparator
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,137 @@
|
||||||
|
/*
|
||||||
|
* <t-moeoEpsilonObjectiveVectorComparator.cpp>
|
||||||
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
* (C) OPAC Team, LIFL, 2002-2008
|
||||||
|
*
|
||||||
|
* 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
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// t-moeoEpsilonObjectiveVectorComparator.cpp
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <moeo>
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
class ObjectiveVectorTraits : public moeoObjectiveVectorTraits
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
static bool minimizing (int i)
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
static bool maximizing (int i)
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
static unsigned int nObjectives ()
|
||||||
|
{
|
||||||
|
return 2;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef moeoRealObjectiveVector < ObjectiveVectorTraits > ObjectiveVector;
|
||||||
|
|
||||||
|
typedef MOEO < ObjectiveVector > Solution;
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
std::cout << "[moeoEpsilonObjectiveVectorComparator]\t=>\t";
|
||||||
|
|
||||||
|
// objective vectors
|
||||||
|
ObjectiveVector obj1;
|
||||||
|
obj1[0] = 2.0;
|
||||||
|
obj1[1] = 5.0;
|
||||||
|
ObjectiveVector obj2;
|
||||||
|
obj2[0] = 2.2;
|
||||||
|
obj2[1] = 5.5;
|
||||||
|
ObjectiveVector obj3;
|
||||||
|
obj3[0] = 3.0;
|
||||||
|
obj3[1] = 5.0;
|
||||||
|
ObjectiveVector obj4;
|
||||||
|
obj4[0] = 3.0;
|
||||||
|
obj4[1] = 6.0;
|
||||||
|
|
||||||
|
// epsilon
|
||||||
|
double epsilon = 1.1;
|
||||||
|
// comparator
|
||||||
|
moeoEpsilonObjectiveVectorComparator< ObjectiveVector > comparator(epsilon);
|
||||||
|
|
||||||
|
// obj1 dominated by obj2? NO
|
||||||
|
if (comparator(obj1, obj2))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj1 dominated by obj2)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj2 dominated by obj1? YES
|
||||||
|
if (! comparator(obj2, obj1))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj2 notdominated by obj1)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj1 dominated by obj3? NO
|
||||||
|
if (comparator(obj1, obj3))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj1 dominated by obj3)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj3 dominated by obj1? NO
|
||||||
|
if (comparator(obj3, obj1))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj3 dominated by obj1)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj1 dominated by obj4? NO
|
||||||
|
if (comparator(obj1, obj4))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj1 dominated by obj4)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj4 dominated by obj1? YES
|
||||||
|
if (! comparator(obj4, obj1))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj4 not dominated by obj1)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::cout << "OK" << std::endl;
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
@ -0,0 +1,132 @@
|
||||||
|
/*
|
||||||
|
* <t-moeoStrictObjectiveVectorComparator.cpp>
|
||||||
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
* (C) OPAC Team, LIFL, 2002-2008
|
||||||
|
*
|
||||||
|
* 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
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// t-moeoStrictObjectiveVectorComparator.cpp
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <moeo>
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
class ObjectiveVectorTraits : public moeoObjectiveVectorTraits
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
static bool minimizing (int i)
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
static bool maximizing (int i)
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
static unsigned int nObjectives ()
|
||||||
|
{
|
||||||
|
return 2;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef moeoRealObjectiveVector < ObjectiveVectorTraits > ObjectiveVector;
|
||||||
|
|
||||||
|
typedef MOEO < ObjectiveVector > Solution;
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
std::cout << "[moeoStrictObjectiveVectorComparator]\t=>\t";
|
||||||
|
|
||||||
|
// objective vectors
|
||||||
|
ObjectiveVector obj1;
|
||||||
|
obj1[0] = 2.0;
|
||||||
|
obj1[1] = 5.0;
|
||||||
|
ObjectiveVector obj2;
|
||||||
|
obj2[0] = 3.0;
|
||||||
|
obj2[1] = 5.0;
|
||||||
|
ObjectiveVector obj3;
|
||||||
|
obj3[0] = 3.0;
|
||||||
|
obj3[1] = 7.0;
|
||||||
|
|
||||||
|
// comparator
|
||||||
|
moeoStrictObjectiveVectorComparator< ObjectiveVector > comparator;
|
||||||
|
|
||||||
|
// obj1 dominated by obj2? NO
|
||||||
|
if (comparator(obj1, obj2))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj1 dominated by obj2)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj2 dominated by obj1? NO
|
||||||
|
if (comparator(obj2, obj1))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj2 dominated by obj1)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj1 dominated by obj3? NO
|
||||||
|
if (comparator(obj1, obj3))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj1 dominated by obj3)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj3 dominated by obj1? YES
|
||||||
|
if (! comparator(obj3, obj1))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj3 not dominated by obj1)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj2 dominated by obj3? NO
|
||||||
|
if (comparator(obj2, obj3))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj2 dominated by obj3)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj3 dominated by obj2? NO
|
||||||
|
if (comparator(obj3, obj2))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj3 dominated by obj2)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::cout << "OK" << std::endl;
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
@ -0,0 +1,135 @@
|
||||||
|
/*
|
||||||
|
* <t-moeoWeakObjectiveVectorComparator.cpp>
|
||||||
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
* (C) OPAC Team, LIFL, 2002-2008
|
||||||
|
*
|
||||||
|
* 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
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// t-moeoWeakObjectiveVectorComparator.cpp
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <moeo>
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
class ObjectiveVectorTraits : public moeoObjectiveVectorTraits
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
static bool minimizing (int i)
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
static bool maximizing (int i)
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
static unsigned int nObjectives ()
|
||||||
|
{
|
||||||
|
return 2;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef moeoRealObjectiveVector < ObjectiveVectorTraits > ObjectiveVector;
|
||||||
|
|
||||||
|
typedef MOEO < ObjectiveVector > Solution;
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
std::cout << "[moeoWeakObjectiveVectorComparator]\t=>\t";
|
||||||
|
|
||||||
|
// objective vectors
|
||||||
|
ObjectiveVector obj1;
|
||||||
|
obj1[0] = 2.0;
|
||||||
|
obj1[1] = 5.0;
|
||||||
|
ObjectiveVector obj2;
|
||||||
|
obj2[0] = 2.0;
|
||||||
|
obj2[1] = 5.0;
|
||||||
|
ObjectiveVector obj3;
|
||||||
|
obj3[0] = 3.0;
|
||||||
|
obj3[1] = 5.0;
|
||||||
|
ObjectiveVector obj4;
|
||||||
|
obj4[0] = 3.0;
|
||||||
|
obj4[1] = 6.0;
|
||||||
|
|
||||||
|
// comparator
|
||||||
|
moeoWeakObjectiveVectorComparator< ObjectiveVector > comparator;
|
||||||
|
|
||||||
|
// obj1 dominated by obj2? YES
|
||||||
|
if (! comparator(obj1, obj2))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj1 not dominated by obj2)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj2 dominated by obj1? YES
|
||||||
|
if (! comparator(obj2, obj1))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj2 not dominated by obj1)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj1 dominated by obj3? NO
|
||||||
|
if (comparator(obj1, obj3))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj1 dominated by obj3)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj3 dominated by obj1? YES
|
||||||
|
if (! comparator(obj3, obj1))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj3 not dominated by obj1)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj3 dominated by obj4? NO
|
||||||
|
if (comparator(obj3, obj4))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj3 dominated by obj4)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// obj4 dominated by obj3? YES
|
||||||
|
if (! comparator(obj4, obj3))
|
||||||
|
{
|
||||||
|
std::cout << "ERROR (obj4 not dominated by obj3)" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::cout << "OK" << std::endl;
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
Loading…
Add table
Add a link
Reference in a new issue