moeoEnvironmentalReplacement.h

/* 
* <moeoEnvironmentalReplacement.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 MOEOENVIRONMENTALREPLACEMENT_H_
#define MOEOENVIRONMENTALREPLACEMENT_H_

#include <comparator/moeoComparator.h>
#include <comparator/moeoFitnessThenDiversityComparator.h>
#include <diversity/moeoDiversityAssignment.h>
#include <fitness/moeoFitnessAssignment.h>
#include <replacement/moeoReplacement.h>

template < class MOEOT > class moeoEnvironmentalReplacement:public moeoReplacement < MOEOT >
{
public:

    typedef typename MOEOT::ObjectiveVector ObjectiveVector;


    moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment, moeoComparator < MOEOT > & _comparator) :
            fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (_comparator)
    {}


    moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoDiversityAssignment < MOEOT > & _diversityAssignment) :
            fitnessAssignment (_fitnessAssignment), diversityAssignment (_diversityAssignment), comparator (defaultComparator)
    {}


    moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment, moeoComparator < MOEOT > & _comparator) :
            fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (_comparator)
    {}


    moeoEnvironmentalReplacement (moeoFitnessAssignment < MOEOT > & _fitnessAssignment) :
            fitnessAssignment (_fitnessAssignment), diversityAssignment (defaultDiversity), comparator (defaultComparator)
    {}


    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);
        diversityAssignment (_parents);
        // remove individuals 1 by 1 and update the fitness values
        unsigned int worstIdx;
        ObjectiveVector worstObjVec;
        while (_parents.size() > sz)
        {
            // the individual to delete
            worstIdx = std::min_element(_parents.begin(), _parents.end(), comparator) - _parents.begin();
            worstObjVec = _parents[worstIdx].objectiveVector();
            // remove the woorst individual
            _parents[worstIdx] = _parents.back();
            _parents.pop_back();
            // update of the fitness and diversity values
            fitnessAssignment.updateByDeleting(_parents, worstObjVec);
            diversityAssignment.updateByDeleting(_parents, worstObjVec);

        }
        // clear the offspring population
        _offspring.clear ();
    }


protected:

    moeoFitnessAssignment < MOEOT > & fitnessAssignment;
    moeoDiversityAssignment < MOEOT > & diversityAssignment;
    moeoDummyDiversityAssignment < MOEOT > defaultDiversity;
    moeoFitnessThenDiversityComparator < MOEOT > defaultComparator;
    class Cmp
    {
    public:
        Cmp(moeoComparator < MOEOT > & _comp) : comp(_comp)
        {}
        bool operator()(const MOEOT & _moeo1, const MOEOT & _moeo2)
        {
            return comp(_moeo1,_moeo2);
        }
    private:
        moeoComparator < MOEOT > & comp;
    } comparator;

};

#endif /*MOEOENVIRONMENTALREPLACEMENT_H_ */

---