-
Notifications
You must be signed in to change notification settings - Fork 1
/
utilities.c
392 lines (315 loc) · 9.53 KB
/
utilities.c
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
/*
AAAA CCCC OOOO TTTTTT SSSSS PPPPP
AA AA CC OO OO TT SS PP PP
AAAAAA CC OO OO TT SSSS PPPPP
AA AA CC OO OO TT SS PP
AA AA CCCC OOOO TT SSSSS PP
######################################################
########## ACO algorithms for the TSP ##########
######################################################
Version: 1.0
File: utilities.c
Author: Thomas Stuetzle
Purpose: some additional useful procedures
Check: README and gpl.txt
Copyright (C) 2002 Thomas Stuetzle
*/
/***************************************************************************
Program's name: acotsp
Ant Colony Optimization algorithms (AS, ACS, EAS, RAS, MMAS, BWAS) for the
symmetric TSP
Copyright (C) 2004 Thomas Stuetzle
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
email: stuetzle no@spam ulb.ac.be
mail address: Universite libre de Bruxelles
IRIDIA, CP 194/6
Av. F. Roosevelt 50
B-1050 Brussels
Belgium
***************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include "InOut.h"
#include "utilities.h"
#include "TSP.h"
#include "ants.h"
#include "timer.h"
double mean( long int *values, long int max )
/*
FUNCTION: compute the average value of an integer array of length max
INPUT: pointer to array, length of array
OUTPUT: average
(SIDE)EFFECTS: none
*/
{
long int j;
double m;
m = 0.;
for ( j = 0 ; j < max ; j++ ) {
m += (double)values[j];
}
m = m / (double)max;
return m;
}
double meanr( double *values, long int max )
/*
FUNCTION: compute the average value of a floating number array of length max
INPUT: pointer to array, length of array
OUTPUT: average
(SIDE)EFFECTS: none
*/
{
long int j;
double m;
m = 0.;
for ( j = 0 ; j < max ; j++ ) {
m += values[j];
}
m = m / (double)max;
return m;
}
double std_deviation( long int *values, long int max, double mean )
/*
FUNCTION: compute the standard deviation of an integer array
INPUT: pointer to array, length of array, mean
OUTPUT: standard deviation
(SIDE)EFFECTS: none
*/
{
long int j;
double dev = 0.;
if (max <= 1)
return 0.;
for ( j = 0 ; j < max; j++ ) {
dev += ((double)values[j] - mean) * ((double)values[j] - mean);
}
return sqrt(dev/(double)(max - 1));
}
double std_deviationr( double *values, long int max, double mean )
/*
FUNCTION: compute the standard deviation of a floating number array
INPUT: pointer to array, length of array, mean
OUTPUT: standard deviation
(SIDE)EFFECTS: none
*/
{
long int j;
double dev;
if (max <= 1)
return 0.;
dev = 0.;
for ( j = 0 ; j < max ; j++ ) {
dev += ((double)values[j] - mean) * ((double)values[j] - mean);
}
return sqrt(dev/(double)(max - 1));
}
long int best_of_vector( long int *values, long int l )
/*
FUNCTION: return the minimum value in an integer value
INPUT: pointer to array, length of array
OUTPUT: smallest number in the array
(SIDE)EFFECTS: none
*/
{
long int min, k;
k = 0;
min = values[k];
for( k = 1 ; k < l ; k++ ) {
if( values[k] < min ) {
min = values[k];
}
}
return min;
}
long int worst_of_vector( long int *values, long int l )
/*
FUNCTION: return the maximum value in an integer value
INPUT: pointer to array, length of array
OUTPUT: largest number in the array
(SIDE)EFFECTS: none
*/
{
long int max, k;
k = 0;
max = values[k];
for( k = 1 ; k < l ; k++ ) {
if( values[k] > max ){
max = values[k];
}
}
return max;
}
double quantil(long int v[], double q, long int l)
/*
FUNCTION: return the q-quantil of an ordered integer array
INPUT: one array, desired quantil q, length of array
OUTPUT: q-quantil of array
(SIDE)EFFECTS: none
*/
{
long int i,j;
double tmp;
tmp = q * (double)l;
if ((double)((long int)tmp) == tmp) {
i = (long int)tmp;
j = (long int)(tmp + 1.);
return ((double)v[i-1] + (double)v[j-1]) / 2.;
} else {
i = (long int)(tmp +1.);
return v[i-1];
}
}
void swap(long int v[], long int i, long int j)
/*
FUNCTION: auxiliary routine for sorting an integer array
INPUT: array, two indices
OUTPUT: none
(SIDE)EFFECTS: elements at position i and j of array are swapped
*/
{
long int tmp;
tmp = v[i];
v[i] = v[j];
v[j] = tmp;
}
void sort(long int v[], long int left, long int right)
/*
FUNCTION: recursive routine (quicksort) for sorting an array
INPUT: one array, two indices
OUTPUT: none
(SIDE)EFFECTS: elements at position i and j of the two arrays are swapped
*/
{
long int k, last;
if (left >= right)
return;
swap(v, left, (left + right)/2);
last = left;
for (k=left+1; k <= right; k++)
if (v[k] < v[left])
swap(v, ++last, k);
swap(v, left, last);
sort(v, left, last);
sort(v, last+1, right);
}
void swap2(long int v[], long int v2[], long int i, long int j)
/*
FUNCTION: auxiliary routine for sorting an integer array
INPUT: two arraya, two indices
OUTPUT: none
(SIDE)EFFECTS: elements at position i and j of the two arrays are swapped
*/
{
long int tmp;
tmp = v[i];
v[i] = v[j];
v[j] = tmp;
tmp = v2[i];
v2[i] = v2[j];
v2[j] = tmp;
}
void sort2(long int v[], long int v2[], long int left, long int right)
/*
FUNCTION: recursive routine (quicksort) for sorting one array; second
arrays does the same sequence of swaps
INPUT: two arrays, two indices
OUTPUT: none
(SIDE)EFFECTS: elements at position i and j of the two arrays are swapped
*/
{
long int k, last;
if (left >= right)
return;
swap2(v, v2, left, (left + right)/2);
last = left;
for (k=left+1; k <= right; k++)
if (v[k] < v[left])
swap2(v, v2, ++last, k);
swap2(v, v2, left, last);
sort2(v, v2, left, last);
sort2(v, v2, last+1, right);
}
double ran01( long *idum )
/*
FUNCTION: generate a random number that is uniformly distributed in [0,1]
INPUT: pointer to variable with the current seed
OUTPUT: random number uniformly distributed in [0,1]
(SIDE)EFFECTS: random number seed is modified (important, this has to be done!)
ORIGIN: numerical recipes in C
*/
{
long k;
double ans;
k =(*idum)/IQ;
*idum = IA * (*idum - k * IQ) - IR * k;
if (*idum < 0 ) *idum += IM;
ans = AM * (*idum);
return ans;
}
long int random_number( long *idum )
/*
FUNCTION: generate an integer random number
INPUT: pointer to variable containing random number seed
OUTPUT: integer random number uniformly distributed in {0,2147483647}
(SIDE)EFFECTS: random number seed is modified (important, has to be done!)
ORIGIN: numerical recipes in C
*/
{
long k;
k =(*idum)/IQ;
*idum = IA * (*idum - k * IQ) - IR * k;
if (*idum < 0 ) *idum += IM;
return *idum;
}
long int ** generate_int_matrix( long int n, long int m)
/*
FUNCTION: malloc a matrix and return pointer to it
INPUT: size of matrix as n x m
OUTPUT: pointer to matrix
(SIDE)EFFECTS:
*/
{
long int i;
long int **matrix;
if((matrix = malloc(sizeof(long int) * n * m +
sizeof(long int *) * n )) == NULL){
printf("Out of memory, exit.");
exit(1);
}
for ( i = 0 ; i < n ; i++ ) {
matrix[i] = (long int *)(matrix + n) + i*m;
}
return matrix;
}
double ** generate_double_matrix( long int n, long int m)
/*
FUNCTION: malloc a matrix and return pointer to it
INPUT: size of matrix as n x m
OUTPUT: pointer to matrix
(SIDE)EFFECTS:
*/
{
long int i;
double **matrix;
if((matrix = malloc(sizeof(double) * n * m +
sizeof(double *) * n )) == NULL){
printf("Out of memory, exit.");
exit(1);
}
for ( i = 0 ; i < n ; i++ ) {
matrix[i] = (double *)(matrix + n) + i*m;
}
return matrix;
}