Information Technology Reference
In-Depth Information
new low 12
{
iteration, elapsed time, new value
}{
11
,
0
.
96806
,
4308
}
new low 13
{
iteration, elapsed time, new value
}{
20
,
19
.
0252
,
4304
}
locally improved
{
4304
,
4242
}
new low 14
{
iteration, elapsed time, new value
}{
20
,
1
.
88812
,
4242
}
{
4242
,
4184
}
locally improved
{
}{
22
,
4
.
29227
,
4184
}
new low 15
iteration, elapsed time, new value
{
}{
29
,
14
.
7769
,
4174
}
new low 16
iteration, elapsed time, new value
new low 17
{
iteration, elapsed time, new value
}{
31
,
4
.
57229
,
4102
}
locally improved
{
4102
,
4096
}
new low 18
{
iteration, elapsed time, new value
}{
37
,
12
.
3448
,
4096
}
locally improved
{
4096
,
4092
}
new low 19
{
iteration, elapsed time, new value
}{
41
,
8
.
0405
,
4092
}
new low 20
{
iteration, elapsed time, new value
}{
51
,
22
.
2414
,
4082
}
new low 21
{
iteration, elapsed time, new value
}{
55
,
8
.
28452
,
4076
}
new low 22
{
iteration, elapsed time, new value
}{
56
,
3
.
51622
,
4072
}
new low 23
{
iteration, elapsed time, new value
}{
56
,
0
.
396025
,
3980
}
new low 24
{
iteration, elapsed time, new value
}{
62
,
13
.
1488
,
3964
}
new low 25
{
iteration, elapsed time, new value
}{
64
,
3
.
03619
,
3952
}
locally improved
{
3952
,
3948
}
new low 26
{
iteration, elapsed time, new value
}{
71
,
16
.
385
,
3948
}
new low 27
{
iteration, elapsed time, new value
}{
75
,
8
.
38452
,
3940
}
new low 28
{
iteration, elapsed time, new value
}{
78
,
6
.
30839
,
3934
}
new low 29
{
iteration, elapsed time, new value
}{
85
,
14
.
0169
,
3930
}
new low 30
{
iteration, elapsed time, new value
}{
85
,
0
.
980061
,
3924
}
new low 31
{
iteration, elapsed time, new value
}{
86
,
1
.
71611
,
3922
}
{
3922
,
3894
}
locally improved
{
}{
89
,
7
.
22845
,
3894
}
new low 32
iteration, elapsed time, new value
{
3894
,
3870
}
locally improved
new low 33
{
iteration, elapsed time, new value
}{
109
,
42
.
1226
,
3870
}
new low 34
{
iteration, elapsed time, new value
}{
119
,
22
.
5814
,
3860
}
new low 35
{
iteration, elapsed time, new value
}{
134
,
33
.
4381
,
3856
}
locally improved
{
3856
,
3840
}
new low 36
{
iteration, elapsed time, new value
}{
142
,
16
.
269
,
3840
}
new low 37
{
iteration, elapsed time, new value
}{
146
,
8
.
72855
,
3830
}
new low 38
{
iteration, elapsed time, new value
}{
174
,
57
.
7716
,
3816
}
new low 39
{
iteration, elapsed time, new value
}{
196
,
44
.
6508
,
3800
}
new low 40
{
iteration, elapsed time, new value
}{
203
,
13
.
5768
,
3788
}
new low 41
{
iteration, elapsed time, new value
}{
203
,
0
.
400025
,
3768
}
locally improved
{
3768
,
3750
}
new low 42
{
iteration, elapsed time, new value
}{
222
,
34
.
3741
,
3750
}
{
590
.
045
,
{
3750
,
{
1
,
19
,
22
,
15
,
13
,
7
,
10
,
9
,
20
,
23
,
21
,
6
,
14
,
4
,
17
,
16
,
3
,
8
,
25
,
12
,
24
,
18
,
11
,
2
,
5
}}}
This is now quite close to the global minimum. As might be observed from the
printout, the swaps occasionally let us escape from seemingly sticky local minima. So,
Search WWH ::
Custom Search