moeoArchive.h

/*
* <moeoArchive.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 MOEOARCHIVE_H_
#define MOEOARCHIVE_H_

#include <eoPop.h>
#include <comparator/moeoObjectiveVectorComparator.h>
#include <comparator/moeoParetoObjectiveVectorComparator.h>

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

    using eoPop < MOEOT > :: size;
    using eoPop < MOEOT > :: resize;
    using eoPop < MOEOT > :: operator[];
    using eoPop < MOEOT > :: back;
    using eoPop < 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 int i = 0; i<size(); i++)
          {
            // if _objectiveVector is dominated by the ith individual of the archive...
            if ( comparator(_objectiveVector, operator[](i).objectiveVector()) )
              {
                return true;
              }
          }
        return false;
      }


    bool contains (const ObjectiveVector & _objectiveVector) const
      {
        for (unsigned int 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 int j=0; j<size();)
        {
          // if the jth solution contained in the archive is dominated by _moeo
          if ( comparator(operator[](j).objectiveVector(), _moeo.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 int j=0; j<size(); j++)
        {
          // if _moeo is dominated by the jth solution contained in the archive
          if ( comparator(_moeo.objectiveVector(), operator[](j).objectiveVector()) )
            {
              dom = true;
              break;
            }
        }
      if (!dom)
        {
          push_back(_moeo);
        }
    }


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


    bool equals (const moeoArchive < MOEOT > & _arch)
    {
      for (unsigned int i=0; i<size(); i++)
        {
          if (! _arch.contains(operator[](i).objectiveVector()))
            {
              return false;
            }
        }
      for (unsigned int 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_ */

---