moeoArchive.h

// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-

//-----------------------------------------------------------------------------
// moeoArchive.h
// (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007
/*
    This library...

    Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr
 */
//-----------------------------------------------------------------------------

#ifndef MOEOARCHIVE_H_
#define MOEOARCHIVE_H_

#include <eoPop.h>
#include <moeoObjectiveVectorComparator.h>

template < class MOEOT >
class moeoArchive : public eoPop < MOEOT >
{
public:

    using std::vector < MOEOT > :: size;
    using std::vector < MOEOT > :: operator[];
    using std::vector < MOEOT > :: back;
    using std::vector < MOEOT > :: pop_back;


    typedef typename MOEOT::ObjectiveVector ObjectiveVector;


    moeoArchive() : eoPop < MOEOT >(), comparator(paretoComparator)
    {}


    moeoArchive(moeoObjectiveVectorComparator < ObjectiveVector > & _comparator) : eoPop < MOEOT >(), comparator(_comparator)
    {}


    bool dominates (const ObjectiveVector & _objectiveVector) const
    {
        for (unsigned i = 0; i<size(); i++)
        {
            if ( comparator(operator[](i).fitness(), _objectiveVector) )
            {
                return true;
            }
        }
        return false;
    }


    bool contains (const ObjectiveVector & _objectiveVector) const
    {
        for (unsigned i = 0; i<size(); i++)
        {
            if (operator[](i).objectiveVector() == _objectiveVector)
            {
                return true;
            }
        }
        return false;
    }


    void update (const MOEOT & _moeo)
    {
        // first step: removing the dominated solutions from the archive
        for (unsigned j=0; j<size();)
        {
            // if _moeo dominates the jth solution contained in the archive
            if ( comparator(_moeo.objectiveVector(), operator[](j).objectiveVector()) )
            {
                operator[](j) = back();
                pop_back();
            }
            else if (_moeo.objectiveVector() == operator[](j).objectiveVector())
            {
                operator[](j) = back();
                pop_back();
            }
            else
            {
                j++;
            }
        }
        // second step: is _moeo dominated?
        bool dom = false;
        for (unsigned j=0; j<size(); j++)
        {
            // if the jth solution contained in the archive dominates _moeo
            if ( comparator(operator[](j).objectiveVector(), _moeo.objectiveVector()) )
            {
                dom = true;
                break;
            }
        }
        if (!dom)
        {
            push_back(_moeo);
        }
    }


    void update (const eoPop < MOEOT > & _pop)
    {
        for (unsigned i=0; i<_pop.size(); i++)
        {
            update(_pop[i]);
        }
    }


    bool equals (const moeoArchive < MOEOT > & _arch)
    {
        for (unsigned i=0; i<size(); i++)
        {
            if (! _arch.contains(operator[](i).objectiveVector()))
            {
                return false;
            }
        }
        for (unsigned i=0; i<_arch.size() ; i++)
        {
            if (! contains(_arch[i].objectiveVector()))
            {
                return false;
            }
        }
        return true;
    }


private:

    moeoObjectiveVectorComparator < ObjectiveVector > & comparator;
    moeoParetoObjectiveVectorComparator < ObjectiveVector > paretoComparator;

};

#endif /*MOEOARCHIVE_H_ */

---