aa5dbe82c6
- relative includes in headers - absolute includes in exe code - include sstream lib in eoExceptions.h - fix ga/make_op_ga.cpp - fix eoSGATransform.h
119 lines
4.4 KiB
C++
119 lines
4.4 KiB
C++
/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
|
|
|
|
-----------------------------------------------------------------------------
|
|
eoTruncatedSelectMany.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@inria.fr
|
|
mkeijzer@dhi.dk
|
|
*/
|
|
//-----------------------------------------------------------------------------
|
|
|
|
#ifndef _eoTruncatedSelectMany_h
|
|
#define _eoTruncatedSelectMany_h
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
#include "eoSelect.h"
|
|
#include "eoSelectOne.h"
|
|
#include "utils/eoHowMany.h"
|
|
#include <math.h>
|
|
//-----------------------------------------------------------------------------
|
|
|
|
/** eoTruncatedSelectMany selects many individuals 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 select,
|
|
and push them to the back of the destination population.
|
|
|
|
And it will only perform selection from the top guys in the population.
|
|
|
|
It is NOT a special case of eoSelectMany because it needs to SORT
|
|
the population to discard the worst guys before doing the selection
|
|
|
|
However, the same result can be obtained by embedding an
|
|
eoTruncatedSelectOne into an eoSelectMany ...
|
|
|
|
@ingroup Selectors
|
|
*/
|
|
template<class EOT>
|
|
class eoTruncatedSelectMany : public eoSelect<EOT>
|
|
{
|
|
public:
|
|
/// Ctor
|
|
eoTruncatedSelectMany(eoSelectOne<EOT>& _select,
|
|
double _rateGenitors, double _rateFertile,
|
|
bool _interpret_as_rateG = true,
|
|
bool _interpret_as_rateF = true)
|
|
: select(_select),
|
|
howManyGenitors(_rateGenitors, _interpret_as_rateG),
|
|
howManyFertile(_rateFertile, _interpret_as_rateF) {}
|
|
|
|
// Ctor with eoHowManys
|
|
eoTruncatedSelectMany(eoSelectOne<EOT>& _select,
|
|
eoHowMany _howManyGenitors, eoHowMany _howManyFertile)
|
|
: select(_select), howManyGenitors(_howManyGenitors),
|
|
howManyFertile(_howManyFertile) {}
|
|
|
|
/**
|
|
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 = howManyGenitors(_source.size());
|
|
|
|
_dest.resize(target);
|
|
|
|
unsigned nbFertile = howManyFertile(_source.size());
|
|
|
|
//revert to standard selection (see eoSelectMany) if no truncation
|
|
if (nbFertile == _source.size())
|
|
{
|
|
select.setup(_source);
|
|
|
|
for (size_t i = 0; i < _dest.size(); ++i)
|
|
_dest[i] = select(_source);
|
|
}
|
|
else
|
|
{
|
|
// at the moment, brute force (rush rush, no good)
|
|
// what we would need otherwise is a std::vector<EOT &> class
|
|
// and selectors that act on such a thing
|
|
eoPop<EOT> tmpPop = _source; // hum hum, could be a pain in the ass
|
|
|
|
tmpPop.sort(); // maybe we could only do partial sort?
|
|
tmpPop.resize(nbFertile); // only the best guys here now
|
|
tmpPop.shuffle(); // as some selectors are order-sensitive
|
|
|
|
select.setup(tmpPop);
|
|
|
|
for (size_t i = 0; i < _dest.size(); ++i)
|
|
_dest[i] = select(tmpPop);
|
|
}
|
|
}
|
|
|
|
private :
|
|
eoSelectOne<EOT>& select; // selector for one guy
|
|
eoHowMany howManyGenitors; // number of guys to select
|
|
eoHowMany howManyFertile; // number of fertile guys
|
|
};
|
|
|
|
#endif
|