nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

some cleanup of memory consumption when using IBEA with a large population

Browse source
This commit is contained in:
Arnaud Liefooghe 2014-10-17 15:04:32 +02:00
commit c5e5af64d0
1 changed files with 137 additions and 113 deletions
Download patch file Download diff file Expand all files Collapse all files

210
moeo/src/fitness/moeoExpBinaryIndicatorBasedFitnessAssignment.h
View file

@ -1,38 +1,43 @@
/* /*
* <moeoExpBinaryIndicatorBasedFitnessAssignment.h> * <moeoExpBinaryIndicatorBasedFitnessAssignment.h>
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2014
* (C) OPAC Team, LIFL, 2002-2007 * (C) OPAC Team, LIFL, 2002-2014
* *
* Arnaud Liefooghe * Arnaud Liefooghe
* *
* This software is governed by the CeCILL license under French law and * Oct 17, 2014 - Arnaud Liefooghe
* abiding by the rules of distribution of free software. You can use, * Modifications on the handling of the internal data structure (values)
* modify and/ or redistribute the software under the terms of the CeCILL * in order to avoid (too much/bad) memory consumptions, in particular
* license as circulated by CEA, CNRS and INRIA at the following URL * when a very large population size is used
* "http://www.cecill.info". *
* * This software is governed by the CeCILL license under French law and
* As a counterpart to the access to the source code and rights to copy, * abiding by the rules of distribution of free software. You can use,
* modify and redistribute granted by the license, users are provided only * modify and/ or redistribute the software under the terms of the CeCILL
* with a limited warranty and the software's author, the holder of the * license as circulated by CEA, CNRS and INRIA at the following URL
* economic rights, and the successive licensors have only limited liability. * "http://www.cecill.info".
* *
* In this respect, the user's attention is drawn to the risks associated * As a counterpart to the access to the source code and rights to copy,
* with loading, using, modifying and/or developing or reproducing the * modify and redistribute granted by the license, users are provided only
* software by the user in light of its specific status of free software, * with a limited warranty and the software's author, the holder of the
* that may mean that it is complicated to manipulate, and that also * economic rights, and the successive licensors have only limited liability.
* therefore means that it is reserved for developers and experienced *
* professionals having in-depth computer knowledge. Users are therefore * In this respect, the user's attention is drawn to the risks associated
* encouraged to load and test the software's suitability as regards their * with loading, using, modifying and/or developing or reproducing the
* requirements in conditions enabling the security of their systems and/or * software by the user in light of its specific status of free software,
* data to be ensured and, more generally, to use and operate it in the * that may mean that it is complicated to manipulate, and that also
* same conditions as regards security. * therefore means that it is reserved for developers and experienced
* The fact that you are presently reading this means that you have had * professionals having in-depth computer knowledge. Users are therefore
* knowledge of the CeCILL license and that you accept its terms. * encouraged to load and test the software's suitability as regards their
* * requirements in conditions enabling the security of their systems and/or
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr * data to be ensured and, more generally, to use and operate it in the
* Contact: paradiseo-help@lists.gforge.inria.fr * 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 MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_ #ifndef MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_
@ -52,21 +57,32 @@
*/ */
template < class MOEOT > template < class MOEOT >
class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorBasedFitnessAssignment < MOEOT > class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorBasedFitnessAssignment < MOEOT >
{ {
public: public:
/** The type of objective vector */ /** The type of objective vector */
typedef typename MOEOT::ObjectiveVector ObjectiveVector; typedef typename MOEOT::ObjectiveVector ObjectiveVector;
typedef typename ObjectiveVector::Type Type; typedef typename ObjectiveVector::Type Type;
typedef typename MOEOT::Fitness Fitness; typedef typename MOEOT::Fitness Fitness;
/** /**
* Ctor. * Ctor.
* @param _metric the quality indicator * @param _metric the quality indicator
* @param _kappa the scaling factor * @param _kappa the scaling factor
*/ */
moeoExpBinaryIndicatorBasedFitnessAssignment(moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa = 0.05) : metric(_metric), kappa(_kappa) moeoExpBinaryIndicatorBasedFitnessAssignment(moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & _metric, const double _kappa = 0.05) : metric(_metric), kappa(_kappa), values(0) {}
{}
/**
* Dtor.
*/
~moeoExpBinaryIndicatorBasedFitnessAssignment()
{
// clear "values"
for (unsigned int i=0; i<values.size(); i++) values[i].clear();
values.clear();
}
/** /**
@ -75,12 +91,12 @@ class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorB
*/ */
virtual void operator()(eoPop < MOEOT > & _pop) virtual void operator()(eoPop < MOEOT > & _pop)
{ {
// 1 - setting of the bounds // 1 - setting of the bounds
setup(_pop); setup(_pop);
// 2 - computing every indicator values // 2 - computing every indicator values
computeValues(_pop); computeValues(_pop);
// 3 - setting fitnesses // 3 - setting fitnesses
setFitnesses(_pop); setFitnesses(_pop);
} }
@ -91,16 +107,17 @@ class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorB
*/ */
void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) void updateByDeleting(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
{ {
std::vector < double > v; std::vector < double > v;
v.resize(_pop.size()); v.resize(_pop.size());
for (unsigned int i=0; i<_pop.size(); i++) for (unsigned int i=0; i<_pop.size(); i++)
{ {
v[i] = metric(_objVec, _pop[i].objectiveVector()); v[i] = metric(_objVec, _pop[i].objectiveVector());
} }
for (unsigned int i=0; i<_pop.size(); i++) for (unsigned int i=0; i<_pop.size(); i++)
{ {
_pop[i].fitness( _pop[i].fitness() + exp(-v[i]/kappa) ); _pop[i].fitness( _pop[i].fitness() + exp(-v[i]/kappa) );
} }
v.clear();
} }
@ -112,34 +129,33 @@ class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorB
*/ */
double updateByAdding(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec) double updateByAdding(eoPop < MOEOT > & _pop, ObjectiveVector & _objVec)
{ {
std::vector < double > v; std::vector < double > v;
// update every fitness values to take the new individual into account // update every fitness values to take the new individual into account
v.resize(_pop.size()); v.resize(_pop.size());
for (unsigned int i=0; i<_pop.size(); i++) for (unsigned int i=0; i<_pop.size(); i++)
{ {
v[i] = metric(_objVec, _pop[i].objectiveVector()); v[i] = metric(_objVec, _pop[i].objectiveVector());
} }
for (unsigned int i=0; i<_pop.size(); i++) for (unsigned int i=0; i<_pop.size(); i++)
{ {
_pop[i].fitness( _pop[i].fitness() - exp(-v[i]/kappa) ); _pop[i].fitness( _pop[i].fitness() - exp(-v[i]/kappa) );
} }
// compute the fitness of the new individual // compute the fitness of the new individual
v.clear(); for (unsigned int i=0; i<_pop.size(); i++)
v.resize(_pop.size());
for (unsigned int i=0; i<_pop.size(); i++)
{ {
v[i] = metric(_pop[i].objectiveVector(), _objVec); v[i] = metric(_pop[i].objectiveVector(), _objVec);
} }
double result = 0; double result = 0;
for (unsigned int i=0; i<v.size(); i++) for (unsigned int i=0; i<v.size(); i++)
{ {
result -= exp(-v[i]/kappa); result -= exp(-v[i]/kappa);
} }
return result; v.clear();
return result;
} }
protected: protected:
/** the quality indicator */ /** the quality indicator */
moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & metric; moeoNormalizedSolutionVsSolutionBinaryMetric < ObjectiveVector, double > & metric;
@ -155,18 +171,18 @@ class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorB
*/ */
void setup(const eoPop < MOEOT > & _pop) void setup(const eoPop < MOEOT > & _pop)
{ {
typename MOEOT::ObjectiveVector::Type min, max; typename MOEOT::ObjectiveVector::Type min, max;
for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++) for (unsigned int i=0; i<ObjectiveVector::Traits::nObjectives(); i++)
{ {
min = _pop[0].objectiveVector()[i]; min = _pop[0].objectiveVector()[i];
max = _pop[0].objectiveVector()[i]; max = _pop[0].objectiveVector()[i];
for (unsigned int j=1; j<_pop.size(); j++) for (unsigned int j=1; j<_pop.size(); j++)
{ {
min = std::min(min, _pop[j].objectiveVector()[i]); min = std::min(min, _pop[j].objectiveVector()[i]);
max = std::max(max, _pop[j].objectiveVector()[i]); max = std::max(max, _pop[j].objectiveVector()[i]);
} }
// setting of the bounds for the objective i // setting of the bounds for the objective i
metric.setup(min, max, i); metric.setup(min, max, i);
} }
} }
@ -177,17 +193,24 @@ class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorB
*/ */
virtual void computeValues(const eoPop < MOEOT > & _pop) virtual void computeValues(const eoPop < MOEOT > & _pop)
{ {
values.clear(); // initialize the values structure (if it is used for the first time with such a population size)
values.resize(_pop.size()); if (values.size() < _pop.size())
for (unsigned int i=0; i<_pop.size(); i++)
{ {
values[i].resize(_pop.size()); values.resize(_pop.size());
// the metric may not be symetric, thus neither is the matrix for (unsigned int i=0; i<values.size(); i++)
for (unsigned int j=0; j<_pop.size(); j++)
{ {
if (i != j) values[i].resize(_pop.size());
}
}
// go
for (unsigned int i=0; i<_pop.size(); i++)
{
// the metric may not be symetric, thus neither is the matrix
for (unsigned int j=0; j<_pop.size(); j++)
{
if (i != j)
{ {
values[i][j] = Type( metric(_pop[i].objectiveVector(), _pop[j].objectiveVector()) ); values[i][j] = Type( metric(_pop[i].objectiveVector(), _pop[j].objectiveVector()) );
} }
} }
} }
@ -200,30 +223,31 @@ class moeoExpBinaryIndicatorBasedFitnessAssignment : public moeoBinaryIndicatorB
*/ */
virtual void setFitnesses(eoPop < MOEOT > & _pop) virtual void setFitnesses(eoPop < MOEOT > & _pop)
{ {
for (unsigned int i=0; i<_pop.size(); i++) for (unsigned int i=0; i<_pop.size(); i++)
{ {
_pop[i].fitness(computeFitness(i)); _pop[i].fitness(computeFitness(_pop, i));
} }
} }
/** /**
* Returns the fitness value of the _idx th individual of the population * Returns the fitness value of the _idx th individual of the population
* @param _pop the population (only useful for its size here)
* @param _idx the index * @param _idx the index
*/ */
virtual Fitness computeFitness(const unsigned int _idx) virtual Fitness computeFitness(const eoPop < MOEOT > & _pop, const unsigned int _idx)
{ {
Fitness result(0.0); Fitness result(0.0);
for (unsigned int i=0; i<values.size(); i++) for (unsigned int i=0; i<_pop.size(); i++)
{ {
if (i != _idx) if (i != _idx)
{ {
result -= exp(-values[i][_idx]/kappa); result -= exp(-values[i][_idx]/kappa);
} }
} }
return result; return result;
} }
}; };
#endif /*MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_*/ #endif /*MOEOEXPBINARYINDICATORBASEDFITNESSASSIGNMENT_H_*/