-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathgeneticalgorithm.h
63 lines (47 loc) · 1.6 KB
/
geneticalgorithm.h
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
/*
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License version 2 as published by the Free Software Foundation.
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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#ifndef GENETICALGORITHM_H
#define GENETICALGORITHM_H
#include <vector>
#include <functional>
#include "property.h"
namespace Tai
{
template <class Gene, class FitnessFunction>
class GeneticAlgorithm
{
public:
typedef Gene GeneType;
GeneticAlgorithm(const FitnessFunction &);
~GeneticAlgorithm();
void iterate();
void setInitialPopulation(const std::vector<Gene> &);
const GeneType& bestGene(){ return population[0];};
const GeneType& worstGene(){ return population[population.size()-1];};
//lng::Property<double> someValue;
private:
std::vector<Gene> population;
FitnessFunction fitnessFunction;
struct MoreFit : public std::binary_function<Gene, Gene, bool>
{
bool operator()(const Gene& g1, const Gene& g2)
{
return g1.fitness() < g2.fitness();
}
};
std::vector<double> m_vResults;
};
}; //namespace Tai
#include "geneticalgorithm.cpp"
#endif //GENETICALGORITHM_H