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), 2006
/*
    This library...

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

#ifndef MOEOARCHIVE_H_
#define MOEOARCHIVE_H_

#include <eoPop.h>

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

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

  typedef typename EOT::Fitness EOFitness;

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

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

  void update (const EOT & _eo)
  {
    // Removing the dominated solutions from the archive
    for (unsigned j = 0; j < size ();)
      {
        if (_eo.fitness ().dominates (operator[](j).fitness ()))
          {
            operator[](j) = back ();
            pop_back ();
          }
        else if (_eo.fitness () == operator[](j).fitness ())
          {
            operator[](j) = back ();
            pop_back ();
          }
        else
          j++;
      }

    // Dominated ?
    bool dom = false;
    for (unsigned j = 0; j < size (); j++)
      if (operator [](j).fitness ().dominates (_eo.fitness ()))
        {
          dom = true;
          break;
        }
    if (!dom)
      push_back (_eo);
  }

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

};

#endif /*MOEOARCHIVE_H_ */

---