-
Notifications
You must be signed in to change notification settings - Fork 0
/
problem.h
56 lines (47 loc) · 2.6 KB
/
problem.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
/***************************************************************************
* Copyright (C) Anders Larsen *
* *
* Use of a Genetic Algoritm to solve a Traveling Salesman Problem. *
* The code can easily be adapted to other types problems as long as *
* solutions can be expressed as fixed length arrays of integers. *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program 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 General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
// This file contains a base class for some problem to solve using the GA.
// A problem must define how to encode, mutate, crossover and evaluate
// solutions. Solutions are stored as vectors of ints.
#ifndef PROBLEM_H
#define PROBLEM_H
#include <vector>
// A Solution is a vector of ints
typedef std::vector<int> Sol;
typedef std::vector<int>::iterator SolIter;
// Genetic operations depend on the problem type
class Problem {
private:
public:
// Generate a random valid solution &s
virtual void encode(Sol &s) = 0;
// Mutate the soultion &s
virtual void mutate(Sol &s) = 0;
// Use old genes in a and b to create new in c and d
virtual void crossover(const Sol &a, const Sol &b, Sol &c, Sol &d) = 0;
// Calculate cost for solution &s
virtual double evaluate(Sol &s) = 0;
};
//---------------------------------------------------------------------------
#endif