Adding more repalcements utilities (see do/make_easea_algo.h)
This commit is contained in:
evomarc
parent
065cc646aa
commit
06ac548f96
3 changed files with 326 additions and 0 deletions
122
eo/src/eoOneToOneBreeder.h
Normal file
122
eo/src/eoOneToOneBreeder.h
Normal file
|
|
@ -0,0 +1,122 @@
|
||||||
|
// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// eoOneToOneBreeder.h
|
||||||
|
// (c) Maarten Keijzer and Marc Schoenauer, 2001
|
||||||
|
/*
|
||||||
|
This library is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU Lesser General Public
|
||||||
|
License as published by the Free Software Foundation; either
|
||||||
|
version 2 of the License, or (at your option) any later version.
|
||||||
|
|
||||||
|
This library is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||||
|
Lesser General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU Lesser General Public
|
||||||
|
License along with this library; if not, write to the Free Software
|
||||||
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
|
||||||
|
Contact: mkeijzer@dhi.dk
|
||||||
|
Marc.Schoenauer@polytechnique.fr
|
||||||
|
*/
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
#ifndef eoOneToOneBreeder_h
|
||||||
|
#define eoOneToOneBreeder_h
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
#include <eoOp.h>
|
||||||
|
#include <eoGenOp.h>
|
||||||
|
#include <eoPopulator.h>
|
||||||
|
#include <eoSelectOne.h>
|
||||||
|
#include <eoBreed.h>
|
||||||
|
#include <utils/eoHowMany.h>
|
||||||
|
|
||||||
|
/*****************************************************************************
|
||||||
|
* eoOneToOneBreeder: transforms a population using
|
||||||
|
* - an operator that MODIFIES only one parent from the populator
|
||||||
|
* (though it can use any number aside) and thus generates ONE offspring)
|
||||||
|
* - a local replacement between the parent and its offspring
|
||||||
|
*
|
||||||
|
* Typically, Differential Evolution (Storn and Price 94) and Deb et al's
|
||||||
|
* G3 can be built on this
|
||||||
|
****************************************************************************
|
||||||
|
*/
|
||||||
|
template<class EOT>
|
||||||
|
class eoOneToOneBreeder: public eoBreed<EOT>
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
/** Ctor:
|
||||||
|
* @param _op a general operator (must MODIFY only ONE parent)
|
||||||
|
* @param _eval an eoEvalFunc to evaluate the offspring
|
||||||
|
* @param _select a selectoOne, to be used for all selections [sequential]
|
||||||
|
* @param _pReplace probability that the best of parent/offspring wins [1]
|
||||||
|
* @param _howMany eoHowMany offpsring to generate [100%]
|
||||||
|
*/
|
||||||
|
eoOneToOneBreeder(
|
||||||
|
eoGenOp<EOT>& _op,
|
||||||
|
eoEvalFunc<EOT> & _eval,
|
||||||
|
double _pReplace = 1.0,
|
||||||
|
eoHowMany _howMany = eoHowMany(1.0) ) :
|
||||||
|
op(_op), eval(_eval), select( false ),
|
||||||
|
pReplace(_pReplace), howMany(_howMany) {}
|
||||||
|
|
||||||
|
|
||||||
|
/** The breeder: iteratively calls the genOp ONCE on a selective populator
|
||||||
|
* after having recorded the parent
|
||||||
|
* Then does the replacement
|
||||||
|
*
|
||||||
|
* @param _parents the initial population
|
||||||
|
* @param _offspring the resulting population (content -if any- is lost)
|
||||||
|
*/
|
||||||
|
void operator()(const eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
|
||||||
|
{
|
||||||
|
unsigned target = howMany(_parents.size());
|
||||||
|
|
||||||
|
_offspring.clear();
|
||||||
|
eoSelectivePopulator<EOT> popit(_parents, _offspring, select);
|
||||||
|
|
||||||
|
for (unsigned iParent=0; iParent<_parents.size(); iParent++)
|
||||||
|
{
|
||||||
|
unsigned pos = popit.tellp(); // remember current position
|
||||||
|
EOT theParent = *popit; // remember the parent itself
|
||||||
|
|
||||||
|
// now apply operator - will modify the parent
|
||||||
|
op(popit);
|
||||||
|
|
||||||
|
// replacement
|
||||||
|
EOT & leOffspring = *popit;
|
||||||
|
|
||||||
|
// check: only one offspring?
|
||||||
|
unsigned posEnd = popit.tellp();
|
||||||
|
if (posEnd != pos)
|
||||||
|
throw runtime_error("Operator can only generate a SINGLE offspring in eoOneToOneBreeder");
|
||||||
|
|
||||||
|
// do the tournament between parent and offspring
|
||||||
|
eval(leOffspring); // first need to evaluate the offspring
|
||||||
|
if (theParent > leOffspring) // old parent better than offspring
|
||||||
|
if (rng.uniform() < pReplace) // if probability
|
||||||
|
leOffspring = theParent; // replace
|
||||||
|
cout << "============ Final =========================\n";
|
||||||
|
cout << _offspring << endl;
|
||||||
|
// finally, go to next guy to handle
|
||||||
|
++popit;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// The class name.
|
||||||
|
virtual string className() const { return "eoOneToOneBreeder"; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
eoGenOp<EOT>& op;
|
||||||
|
eoEvalFunc<EOT> & eval;
|
||||||
|
eoSequentialSelect<EOT> select;
|
||||||
|
double pReplace;
|
||||||
|
eoHowMany howMany;
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
131
eo/src/eoSharing.h
Normal file
131
eo/src/eoSharing.h
Normal file
|
|
@ -0,0 +1,131 @@
|
||||||
|
/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
|
||||||
|
|
||||||
|
-----------------------------------------------------------------------------
|
||||||
|
eoSharing.h
|
||||||
|
(c) Maarten Keijzer, Marc Schoenauer, 2001
|
||||||
|
|
||||||
|
This library is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU Lesser General Public
|
||||||
|
License as published by the Free Software Foundation; either
|
||||||
|
version 2 of the License, or (at your option) any later version.
|
||||||
|
|
||||||
|
This library is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||||
|
Lesser General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU Lesser General Public
|
||||||
|
License along with this library; if not, write to the Free Software
|
||||||
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
|
||||||
|
Contact: Marc.Schoenauer@inria.fr
|
||||||
|
mkeijzer@dhi.dk
|
||||||
|
*/
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
#ifndef eoSharing_h
|
||||||
|
#define eoPerf2Worth_h
|
||||||
|
|
||||||
|
#include <eoPerf2Worth.h>
|
||||||
|
#include <utils/eoDistance.h>
|
||||||
|
|
||||||
|
/** Sharing is a perf2worth class that implements
|
||||||
|
* Goldberg and Richardson's basic sharing
|
||||||
|
*/
|
||||||
|
// template <class EOT, class Dist = eoQuadDistance<EOT> >
|
||||||
|
template <class EOT>
|
||||||
|
class eoSharing : public eoPerf2Worth<EOT, double>
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
/** Ctor with only nicheSize: will use the default eoQuadDistance */
|
||||||
|
eoSharing(double _nicheSize) : eoPerf2Worth("Sharing"),
|
||||||
|
nicheSize(_nicheSize),
|
||||||
|
dist(repDist)
|
||||||
|
{}
|
||||||
|
|
||||||
|
eoSharing(double _nicheSize, Dist _dist) : eoPerf2Worth("Sharing"),
|
||||||
|
nicheSize(_nicheSize),
|
||||||
|
dist(_dist)
|
||||||
|
{}
|
||||||
|
|
||||||
|
/** Computes shared fitnesses
|
||||||
|
*/
|
||||||
|
void operator()(const eoPop<EOT>& _pop)
|
||||||
|
{
|
||||||
|
unsigned i, j,
|
||||||
|
pSize=_pop.size();
|
||||||
|
if (pSize <= 1)
|
||||||
|
throw runtime_error("Apptempt to do sharing with population of size 1");
|
||||||
|
value.resize(pSize);
|
||||||
|
vector<double> sim(pSize); // to hold the similarities
|
||||||
|
vector<double> distMatrix(pSize*(pSize-1)/2); // to hold the distances
|
||||||
|
|
||||||
|
// compute the distances
|
||||||
|
distMatrix(0,0)=0;
|
||||||
|
for (i=1; i<pSize; i++)
|
||||||
|
{
|
||||||
|
distMatrix(i,i)=0;
|
||||||
|
for (j=0; j<i; j++)
|
||||||
|
{
|
||||||
|
distMatrix(i,j) = distMatrix(j,i) = dist(_pop[i], _pop[j]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// compute the similarities
|
||||||
|
for (i=0; i<pSize; i++)
|
||||||
|
{
|
||||||
|
double sum=0.0;
|
||||||
|
for (j=0; j<pSize; j++)
|
||||||
|
sum += distMatrix(i,j);
|
||||||
|
sim[i] = sum;
|
||||||
|
|
||||||
|
}
|
||||||
|
// now set the worthes values
|
||||||
|
for (i = 0; i < _pop.size(); ++i)
|
||||||
|
value()[i]=_pop[i].fitness()/sim[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
// helper class to hold distances
|
||||||
|
class dMatrix : public vector<double>
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
// Ctor : sets size
|
||||||
|
dMatrix(unsigned _s) : vector<double>(_s*(_s-1)), rSize(_s) {}
|
||||||
|
|
||||||
|
/** simple accessor */
|
||||||
|
double operator()(unsigned _i, unsigned _j) const
|
||||||
|
{
|
||||||
|
return this->operator[](_i*rSize + _j);
|
||||||
|
}
|
||||||
|
|
||||||
|
/** reference - to set values */
|
||||||
|
double & operator()(unsigned _i, unsigned _j)
|
||||||
|
{
|
||||||
|
return this->operator[](_i*rSize + _j);
|
||||||
|
}
|
||||||
|
|
||||||
|
/** just in case */
|
||||||
|
void printOn(ostream & _os)
|
||||||
|
{
|
||||||
|
unsigned index=0;
|
||||||
|
for (unsigned i=0; i<rSize; i++)
|
||||||
|
{
|
||||||
|
for (unsigned j=0; j<rSize; j++)
|
||||||
|
_os << this->operator[](index++) << " " ;
|
||||||
|
_os << endl;
|
||||||
|
}
|
||||||
|
_os << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
unsigned rSize; // row size (== number of columns!)
|
||||||
|
};
|
||||||
|
|
||||||
|
// private data of class eoSharing
|
||||||
|
private:
|
||||||
|
double nicheSize;
|
||||||
|
eoQuadDistance<EOT> repDist; // default distance
|
||||||
|
eoDistance & dist; // allows to pass a specific distance
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif
|
||||||
73
eo/src/eoTruncSelect.h
Normal file
73
eo/src/eoTruncSelect.h
Normal file
|
|
@ -0,0 +1,73 @@
|
||||||
|
/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
|
||||||
|
|
||||||
|
-----------------------------------------------------------------------------
|
||||||
|
eoTruncSelect.h
|
||||||
|
(c) Maarten Keijzer, Marc Schoenauer, GeNeura Team, 2002
|
||||||
|
|
||||||
|
This library is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU Lesser General Public
|
||||||
|
License as published by the Free Software Foundation; either
|
||||||
|
version 2 of the License, or (at your option) any later version.
|
||||||
|
|
||||||
|
This library is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||||
|
Lesser General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU Lesser General Public
|
||||||
|
License along with this library; if not, write to the Free Software
|
||||||
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
|
||||||
|
Contact: todos@geneura.ugr.es, http://geneura.ugr.es
|
||||||
|
Marc.Schoenauer@polytechnique.fr
|
||||||
|
mkeijzer@dhi.dk
|
||||||
|
*/
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
#ifndef _eoTruncSelect_h
|
||||||
|
#define _eoTruncSelect_h
|
||||||
|
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#include <eoSelect.h>
|
||||||
|
#include <utils/eoHowMany.h>
|
||||||
|
#include <math.h>
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
/** eoTruncSelect selects individuals after truncating the population
|
||||||
|
* using eoSelectOne as it's mechanism.
|
||||||
|
* Therefore eoSelectMany needs an eoSelectOne in its ctor
|
||||||
|
* It will use an eoHowMnay to determine the number of guys to keep,
|
||||||
|
*/
|
||||||
|
template<class EOT>
|
||||||
|
class eoTruncSelect : public eoSelect<EOT>
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
/** Ctor: from an eoSelect (and an eoMany to tell how many are kept for selectino */
|
||||||
|
eoSelectMany(eoSelectOne<EOT>& _select, eoHowMany _howMany)
|
||||||
|
: select(_select), howMany(_howMany) {}
|
||||||
|
|
||||||
|
/**
|
||||||
|
The implementation repeatidly selects an individual
|
||||||
|
|
||||||
|
@param _source the source population
|
||||||
|
@param _dest the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
|
||||||
|
*/
|
||||||
|
virtual void operator()(const eoPop<EOT>& _source, eoPop<EOT>& _dest)
|
||||||
|
{
|
||||||
|
unsigned target = howMany(_source.size());
|
||||||
|
|
||||||
|
_dest.resize(target);
|
||||||
|
|
||||||
|
select.setup(_source);
|
||||||
|
|
||||||
|
for (size_t i = 0; i < _dest.size(); ++i)
|
||||||
|
_dest[i] = select(_source);
|
||||||
|
}
|
||||||
|
|
||||||
|
private :
|
||||||
|
eoSelectOne<EOT>& select;
|
||||||
|
eoHowMany howMany;
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif
|
||||||
Reference in a new issue