-
Notifications
You must be signed in to change notification settings - Fork 1
/
utilities.h
108 lines (71 loc) · 3.26 KB
/
utilities.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
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
/*
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.h
Author: Thomas Stuetzle
Purpose: some additional useful procedures
Check: README.txt and legal.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
***************************************************************************/
#define INFTY LONG_MAX
#define MAXIMUM_NO_TRIES 100
#define TRUE 1
#define FALSE 0
/* general macros */
#define MAX(x,y) ((x)>=(y)?(x):(y))
#define MIN(x,y) ((x)<=(y)?(x):(y))
#define DEBUG( x )
#define TRACE( x )
/* constants for a random number generator, for details see numerical recipes in C */
#define IA 16807
#define IM 2147483647
#define AM (1.0/IM)
#define IQ 127773
#define IR 2836
#define MASK 123459876
extern long int seed;
double mean ( long int *values, long int max);
double meanr ( double *values, long int max );
double std_deviation ( long int *values, long int i, double mean );
double std_deviationr ( double *values, long int i, double mean );
long int best_of_vector ( long int *values, long int i );
long int worst_of_vector ( long int *values, long int i );
void swap ( long int v[], long int i, long int j );
void sort ( long int v[], long int left, long int right );
double quantil ( long int vector[], double q, long int numbers );
void swap2(long int v[], long int v2[], long int i, long int j);
void sort2(long int v[], long int v2[], long int left, long int right);
double ran01 ( long *idum );
long int random_number ( long *idum );
long int ** generate_int_matrix( long int n, long int m);
double ** generate_double_matrix( long int n, long int m);