-
Notifications
You must be signed in to change notification settings - Fork 4
/
main.cpp
90 lines (70 loc) · 2.43 KB
/
main.cpp
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
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 4; tab-width: 4 -*- */
/*
* GPX2: Generalized Partition Crossover 2
* Reference: R. Tinos, D. Whitley, and G. Ochoa (2017). A new generalized partition crossover for *
* the traveling salesman problem: tunneling between local optima. arXiv.org *
* Contact: Renato Tinos <[email protected]>
*
* gpx2 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 3 of the License, or
* (at your option) any later version.
*
* gpx2 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, see <http://www.gnu.org/licenses/>.
*/
#include "defs.h"
#include <cstdlib>
#include <cmath>
/******************************************************************************\
* random initialization of the parents *
\******************************************************************************/
void rand_init(int *p1, int *p2){
int *v_in, gene;
v_in=aloc_vectori(n_cities);
for (gene=0;gene<n_cities;gene++) {
v_in[gene]=gene;
}
rand_perm(v_in, p1, n_cities); // random permutation of v_in
rand_perm(v_in, p2, n_cities); // random permutation of v_in
delete [] v_in;
}
/******************************************************************************\
* Main *
\******************************************************************************/
int main(int argc , char *argv[])
{
int *p1, *p2, *offspring;
double cost;
// Arguments
if( argc < 2) {
cout<<"Insufficient number of arguments!"<<endl;
exit(1);
}
else{
prob_name=argv[1];
}
// TSP
read_problem(prob_name);
cout << "\n ***** Example: recombination of 2 random individuals ****" << endl;
p1=aloc_vectori(n_cities);
p2=aloc_vectori(n_cities);
offspring=aloc_vectori(n_cities);
rand_init(p1, p2); // random initialization of the parents
// Recombination by GPX2
cost=gpx( p1 , p2 , offspring );
cout<<"Cost="<<cost<<endl;
if (n_cities<=15000)
desaloc_matrixi (W,n_cities);
delete [] coord_x;
delete [] coord_y;
delete [] p1;
delete [] p2;
delete [] offspring;
return 0;
}