/usr/include/libevocosm/selector.h is in libevocosm-dev 4.0.2-3.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 | /*
Evocosm is a C++ framework for implementing evolutionary algorithms.
Copyright 2011 Scott Robert Ladd. All rights reserved.
Evocosm is user-supported open source software. Its continued development is dependent
on financial support from the community. You can provide funding by visiting the Evocosm
website at:
http://www.coyotegulch.com
You may license Evocosm in one of two fashions:
1) Simplified BSD License (FreeBSD License)
Redistribution and use in source and binary forms, with or without modification, are
permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of
conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice, this list
of conditions and the following disclaimer in the documentation and/or other materials
provided with the distribution.
THIS SOFTWARE IS PROVIDED BY SCOTT ROBERT LADD ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SCOTT ROBERT LADD OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
The views and conclusions contained in the software and documentation are those of the
authors and should not be interpreted as representing official policies, either expressed
or implied, of Scott Robert Ladd.
2) Closed-Source Proprietary License
If your project is a closed-source or proprietary project, the Simplified BSD License may
not be appropriate or desirable. In such cases, contact the Evocosm copyright holder to
arrange your purchase of an appropriate license.
The author can be contacted at:
scott.ladd@coyotegulch.com
scott.ladd@gmail.com
http:www.coyotegulch.com
*/
#if !defined(EVOCOSM_SELECTOR_H)
#define EVOCOSM_SELECTOR_H
// Standard C++ Library
#include <algorithm>
// libevocosm
#include "organism.h"
namespace libevocosm
{
//! Selects organisms that survive
/*!
A selector decides which organisms survive from one generation to the
next. Some evolutionary algorithms will not use a selector; others will.
In general, it is effective to keep the "best" organisms from one
generation ot the next, so that good genes do not become lost at
random.
<p>
Of course, "real" nature isn't so kind; just because you're the
biggest stag in the forest doesn't mean you won't get shot! In fact,
that may say something about the "best" -- maybe the "best" stag is
the one that is too ugly for anyone to hunt?
\param OrganismType - The type of organism being selected
*/
template <class OrganismType>
class selector : protected globals
{
public:
//! Virtual destructor
/*!
A virtual destructor. By default, it does nothing; this is
a placeholder that identifies this class as a potential base,
ensuring that objects of a derived class will have their
destructors called if they are destroyed through a base-class
pointer.
*/
virtual ~selector()
{
// nada
}
//! Select individuals that survive
/*!
Produces a vector containing copies of the organisms selected for
survival.
\param a_population - A population of organisms
\return A population of copied survivors
*/
virtual vector<OrganismType> select_survivors(vector<OrganismType> & a_population) = 0;
};
//! A do-nothing selector
/*!
The null_selector doesn't select anything; it's just a placeholder used
in evolutionary algorithms that do not use survival.
\param OrganismType - The type of organism
*/
template <class OrganismType>
class null_selector : public selector<OrganismType>
{
public:
// Do-nothing selection function
/*!
Has no effect on the target population.
\param a_population - A population of organisms
*/
virtual vector<OrganismType> select_survivors(vector<OrganismType> & a_population)
{
return vector<OrganismType>(); // an empty vector
}
};
//! A do-nothing selector
/*!
The all_selector returns a copy of the original population, all organisms survive.
This is primarily used for development and testing, and is of little practical use.
\param OrganismType - The type of organism
*/
template <class OrganismType>
class all_selector : public selector<OrganismType>
{
public:
// Do-nothing selection function
/*!
Has no effect on the target population.
\param a_population - A population of organisms
*/
virtual vector<OrganismType> select_survivors(vector<OrganismType> & a_population)
{
vector<OrganismType> result;
for (int n = 0; n < a_population.size(); ++n)
result.push_back(a_population[n]);
return result;
}
};
//! Implements a elitism selector
/*!
Elitism is one of the simplest type of selection -- it simply says that
the <i>n</i> best organisms will survive into the next generation.
\param OrganismType - The type of organism
*/
template <class OrganismType>
class elitism_selector : public selector<OrganismType>
{
public:
//! Constructor
/*!
Constructs a new elistism_selector with a value that defines the number of
organisms that should survive into the next generation.
\param a_factor - Percentage of bets fitness required to surivive
*/
elitism_selector(double a_factor = 0.9)
: m_factor(a_factor)
{
// nada
}
//! Copy constructor
/*!
Creates a new object identical to an existing one.
\param a_source - The source object
*/
elitism_selector(const elitism_selector<OrganismType> & a_source)
: m_factor(a_source.m_factor)
{
// nada
}
//! Assignment operator
/*!
Assigns an existing object the state of another.
\param a_source - The source object
*/
elitism_selector & operator = (const elitism_selector<OrganismType> & a_source)
{
m_factor = a_source.m_factor;
}
//! Select individuals that survive
/*!
Produces a vector containing copies of the organisms selected for
survival.
\param a_population - A population of organisms
\return A population of copied survivors
*/
virtual vector<OrganismType> select_survivors(vector<OrganismType> & a_population);
private:
// number of organisms to keep
double m_factor;
};
template <class OrganismType>
vector<OrganismType> elitism_selector<OrganismType>::select_survivors(vector<OrganismType> & a_population)
{
// create a new vector
vector<OrganismType> chosen_ones;
// get population stats
fitness_stats<OrganismType> stats(a_population);
// calculate survival based on percentage of best fitness
double threshold = m_factor * stats.getBest().fitness;
// pick survivors
for (int n = 0; n < a_population.size(); ++n)
{
if (a_population[n].fitness > threshold)
chosen_ones.push_back(a_population[n]);
}
// return result
return chosen_ones;
}
};
#endif
|