#include <fstream.h>
const long n_max = 351; // maximum size of the problem
/* Programme for approximately solving the quadratic assignment problem.
Language : c++; compiler g++ should work.
Method: FANT, Described in E. D. Taillard,
"FANT: Fast ant system",
Technical report IDSIA-46-98, IDSIA, Lugano, 1998.
Implementation : E. Taillard, 14. 10. 98
Copyright : E. Taillard, 14. 10. 98
Available on : http://www.eivd.ch/ina/collaborateurs/etd
Data :
size of the problem, parameter R, number of FANT iterations
distance matrix
flow matrix
Exemple of valid data
(for problem tai10b, to be included in a file, e. g. tai10b.dat) :
10 6 50
0 19 78 60 79 45 65 37 103 34
19 0 65 45 76 63 79 22 109 19
78 65 0 21 44 113 104 72 97 73
60 45 21 0 53 99 97 50 102 51
79 76 44 53 0 98 74 93 54 92
45 63 113 99 98 0 42 81 97 78
65 79 104 97 74 42 0 100 57 98
37 22 72 50 93 81 100 0 130 3
103 109 97 102 54 97 57 130 0 128
34 19 73 51 92 78 98 3 128 0
0 1 0 2 0 0 15 0 0 172
171 0 0 14 0 61 30 0 886 45
43 0 0 2106 1 0 0 0 0 0
361 0 0 0 0 0 0 0 0 0
2 123 1 0 0 49 18 0 335 2417
1096 0 0 0 0 0 952 5 0 0
207 3703 27 0 4 0 0 0 202 0
