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
|
// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
//-----------------------------------------------------------------------------
// eoAlgo.h
// (c) GeNeura Team, 1998
/*
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
*/
//-----------------------------------------------------------------------------
#ifndef _EOALGO_H
#define _EOALGO_H
#include <eoPop.h> // for population
#include <eoFunctor.h>
/**
@defgroup Algorithms Algorithms
In EO, an algorithm is a functor that takes one or several solutions to an optimization
problem as arguments, and iteratively modify them with the help of operators.
Generally, an EO object is built by assembling together @ref Operators in an algorithm instance,
and then calling the algorithm's operator() on an initial population (an eoPop). The algorithm will then
manipulate the solutions within the population to search for the problem's optimum.
*/
/**
This is the base class for population-transforming algorithms. There
is only one operator defined, which takes a population and does stuff to
it. It needn't be a complete algorithm, can be also a step of an
algorithm. This class just gives a common interface to linear
population-transforming algorithms.
@ingroup Algorithms
*/
template< class EOT >
class eoAlgo : public eoUF<eoPop<EOT>&, void>
{};
#endif
|
