freESPlusSelection.txx

Go to the documentation of this file.

/*=========================================================================

  Program:   F.R.E.E. - flexible registration evaluation engine
  Version:   v.1.0.0
  Date:      $Date: 2006/09/01 12:00:00 $
  Module:    $RCSfile: freESPlusSelection.txx,v $
  Language:  C++



  Copyright (c) 2007 Ralf o Floca (Department of Medical Informatics,
  Institute for Medical Biometry and Informatics, University of Heidelberg,
  Germany). All rights reserved.
  See FREECopyright.txt or http://www.mi.med.uni-hd.de/free/copyright.htm
  for details.

     This software is distributed WITHOUT ANY WARRANTY; without even 
     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR 
     PURPOSE.  See the above copyright notices for more information.

=========================================================================*/
#ifndef _freESPlusSelection_txx
#define _freESPlusSelection_txx

#include "freESPlusSelection.h"

namespace FREE
{
  namespace ES
  {

    template <class TIndividual>
    PlusSelection<TIndividual>
      ::PlusSelection()
    {
    }

    template <class TIndividual>
    typename PlusSelection<TIndividual>::PopulationPointer
    PlusSelection<TIndividual>
    ::Select(PopulationType* pPopulation, PopulationSizeType newSize) const
    {
      if (!pPopulation) throwExceptionMacro("Error. Passed population is NULL.");
      if (pPopulation->Size()<newSize) throwExceptionMacro("Error. Passed population is already smaller the prefered size, nothing to select. Population size: "<<pPopulation->Size()<<"; new size: "<<newSize);

      PopulationPointer removedPopulation = PopulationType::New();

      while (pPopulation->Size()>newSize)
      {
        typename IndividualType::ObjectiveValueType worstValue = ((*pPopulation)[0])->GetObjectiveValue();
        unsigned long worstIndex = 0;

        for (unsigned long index = 1; index < pPopulation->Size(); index++)
        { //find worst individual
          if (this->GetMaximumIsBest())
          {
            if (worstValue>((*pPopulation)[index])->GetObjectiveValue())
            {
              worstValue = ((*pPopulation)[index])->GetObjectiveValue();
              worstIndex = index;
            }
          }
          else
          {
            if (worstValue<((*pPopulation)[index])->GetObjectiveValue())
            {
              worstValue = ((*pPopulation)[index])->GetObjectiveValue();
              worstIndex = index;
            }
          }
        }
        //remove worst individual and add it to the population of removed individuals
        removedPopulation->push_back((*pPopulation)[worstIndex]);
        pPopulation->erase(pPopulation->begin()+worstIndex);
      }

      return removedPopulation;
    };

  } // end of namespace ES
} // end of namespace FREE

#endif

---