68ec20fd66
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1363 331e1502-861f-0410-8da2-ba01fb791d7f
184 lines
7.6 KiB
C++
184 lines
7.6 KiB
C++
/*
|
|
* <moeoElitistReplacement.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 MOEOELITISTREPLACEMENT2_H_
|
|
#define MOEOELITISTREPLACEMENT2_H_
|
|
|
|
#include <comparator/moeoComparator.h>
|
|
#include <comparator/moeoFitnessThenDiversityComparator.h>
|
|
#include <diversity/moeoDiversityAssignment.h>
|
|
#include <diversity/moeoDummyDiversityAssignment.h>
|
|
#include <fitness/moeoFitnessAssignment.h>
|
|
#include <replacement/moeoReplacement.h>
|
|
#include <vectorSortIndex.h>
|
|
|
|
/**
|
|
* Elitist replacement strategy that consists in keeping the N best individuals.
|
|
*/
|
|
template < class MOEOT > class moeoElitistReplacement2:public moeoReplacement < MOEOT >
|
|
{
|
|
public:
|
|
|
|
/**
|
|
* Full constructor.
|
|
* @param _fitnessAssignment the fitness assignment strategy
|
|
* @param _diversityAssignment the diversity assignment strategy
|
|
* @param _comparator the comparator (used to compare 2 individuals)
|
|
*/
|
|
moeoElitistReplacement2 (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment, moeoComparator < MOEOT > & _comparator) :
|
|
fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (_comparator)
|
|
{}
|
|
|
|
|
|
/**
|
|
* Constructor without comparator. A moeoFitThenDivComparator is used as default.
|
|
* @param _fitnessAssignment the fitness assignment strategy
|
|
* @param _diversityAssignment the diversity assignment strategy
|
|
*/
|
|
moeoElitistReplacement2 (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment) :
|
|
fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (defaultComparator)
|
|
{}
|
|
|
|
|
|
/**
|
|
* Constructor without moeoDiversityAssignement. A dummy diversity is used as default.
|
|
* @param _fitnessAssignment the fitness assignment strategy
|
|
* @param _comparator the comparator (used to compare 2 individuals)
|
|
*/
|
|
moeoElitistReplacement2 (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoComparator < MOEOT > & _comparator) :
|
|
fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (_comparator)
|
|
{}
|
|
|
|
|
|
/**
|
|
* Constructor without moeoDiversityAssignement nor moeoComparator.
|
|
* A moeoFitThenDivComparator and a dummy diversity are used as default.
|
|
* @param _fitnessAssignment the fitness assignment strategy
|
|
*/
|
|
moeoElitistReplacement2 (moeoFitnessAssignment < MOEOT > & _fitnessAssignment) :
|
|
fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (defaultComparator)
|
|
{}
|
|
|
|
|
|
/**
|
|
* Replaces the first population by adding the individuals of the second one, sorting with a moeoComparator and resizing the whole population obtained.
|
|
* @param _parents the population composed of the parents (the population you want to replace)
|
|
* @param _offspring the offspring population
|
|
*/
|
|
void operator () (eoPop < MOEOT > &_parents, eoPop < MOEOT > &_offspring)
|
|
{
|
|
unsigned int sz = _parents.size ();
|
|
// merges offspring and parents into a global population
|
|
_parents.reserve (_parents.size () + _offspring.size ());
|
|
std::copy (_offspring.begin (), _offspring.end (), back_inserter (_parents));
|
|
// evaluates the fitness and the diversity of this global population
|
|
fitnessAssignment (_parents);
|
|
// diversity assignment does several pop sorts, so it is better to performs
|
|
// these operations on pointers to avoid copy of individuals
|
|
|
|
diversityAssignment(_parents);
|
|
// sorts the whole population
|
|
// the delindex contains the ordered index of the population according to the comparator again, we only sort the index of population instead of population
|
|
std::vector<unsigned int> delindex;
|
|
vectorSortIndex( _parents, delindex, comparator);
|
|
// now, in order to rezise of population we remove the populations whose index
|
|
// are in the high of delindex
|
|
std::sort(delindex.begin()+sz, delindex.end(), std::greater<int>());
|
|
// finally, resize this global population
|
|
reduce_population( _parents, delindex,sz);
|
|
//_parents.resize (sz);
|
|
// and clear the offspring population
|
|
_offspring.clear ();
|
|
}
|
|
|
|
|
|
/**
|
|
* Resizes the whole population obtained.
|
|
* @param _pop the whole population
|
|
* @param _index points to the population members which will be deleted
|
|
* @param _sz size of the resulting population
|
|
*/
|
|
|
|
|
|
void reduce_population ( eoPop < MOEOT > &_pop, std::vector<unsigned int> &index, unsigned int size)
|
|
{
|
|
for(int j=size; j< index.size(); j++)
|
|
{
|
|
if( index[j] < index.size()-1)
|
|
_pop[ index[j] ] = _pop.back();
|
|
_pop.pop_back();
|
|
}
|
|
};
|
|
|
|
protected:
|
|
|
|
/** the fitness assignment strategy */
|
|
moeoFitnessAssignment < MOEOT > & fitnessAssignment;
|
|
/** the diversity assignment strategy */
|
|
moeoDiversityAssignment < MOEOT > & diversityAssignment;
|
|
/** a dummy diversity assignment can be used as default */
|
|
//moeoComparator <MOEOT> & comparator;
|
|
moeoDummyDiversityAssignment < MOEOT > defaultDiversity;
|
|
/** a fitness then diversity comparator can be used as default */
|
|
moeoFitnessThenDiversityComparator < MOEOT > defaultComparator;
|
|
/** this object is used to compare solutions in order to sort the population */
|
|
class Cmp
|
|
{
|
|
public:
|
|
/**
|
|
* Ctor.
|
|
* @param _comp the comparator
|
|
*/
|
|
Cmp(moeoComparator < MOEOT > & _comp) : comp(_comp)
|
|
{}
|
|
/**
|
|
* Returns true if _moeo1 is greater than _moeo2 according to the comparator
|
|
* _moeo1 the first individual
|
|
* _moeo2 the first individual
|
|
*/
|
|
bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
|
|
{
|
|
return comp(_moeo2,_moeo1);
|
|
}
|
|
private:
|
|
/** the comparator */
|
|
moeoComparator < MOEOT > & comp;
|
|
}
|
|
comparator;
|
|
};
|
|
|
|
#endif /*MOEOELITISTREPLACEMENT_H_ */
|