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
|
/*
Copyright (C) 1997,1998,1999,2000,2001 Franz Josef Och
mkcls - a program for making word classes .
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.
*/
#include "MYOptimization.h"
MYOptimization::MYOptimization(Problem &p,int m)
: IterOptimization(p,m),acceptFlagsNumber(0),acceptions(0),total(0)
{
}
MYOptimization::MYOptimization(MYOptimization &o)
: IterOptimization(o),acceptFlagsNumber(0),acceptions(0),total(0)
{
}
short MYOptimization::accept(double delta)
{
int doIt;
int verbesserung = delta<0;
if( delta < 0 )
doIt=1;
else
{
if(total>=NUMBER_OF_ACCEPTIONS)
{
double prob = acceptions/(float)(NUMBER_OF_ACCEPTIONS);
double zuf = zufall01();
doIt=zuf<prob;
}
else
doIt=0;
}
if( total>=NUMBER_OF_ACCEPTIONS )
{
if( acceptFlags[acceptFlagsNumber] )
acceptions--;
}
acceptFlags[acceptFlagsNumber]=verbesserung;
if( verbesserung )
acceptions++;
total++;
acceptFlagsNumber++;
if(acceptFlagsNumber>=NUMBER_OF_ACCEPTIONS)
acceptFlagsNumber=0;
return doIt;
}
short MYOptimization::end()
{
return endFlag>0 && total>NUMBER_OF_ACCEPTIONS && acceptions==0;
}
void MYOptimization::abkuehlen()
{
}
void MYOptimization::makeGraphOutput()
{
IterOptimization::makeGraphOutput();
*GraphOutput << acceptions;
}
|
