-
Notifications
You must be signed in to change notification settings - Fork 0
/
djoinhistlpi_sm.c
286 lines (234 loc) · 8.04 KB
/
djoinhistlpi_sm.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
#include <stdlib.h>
#include <glibwrap.h>
#include <limits.h>
#include <glpk.h>
#include "deps.h"
#include "sm.h"
#define ENABLE_CPLEX 1
#if !ENABLE_CPLEX
#include <glpk_cplex_wrap.h>
#else
#include <ilcplex/cplex.h>
#include <ilcplex/cplexdistmip.h>
#endif
#define LP_WITH_NAMED_VARS
void lpi_sm_optimize_hr(dataset_histogram *hr, int servers,
optimization_data_s *opt_data, int opt_atu, multiway_histogram_estimate *agg_server,
double f, bool only_root_node) {
printf("\n============ Building CPLEX model =============\n");
CPXENVptr env = NULL;
CPXLPptr lp = NULL;
int status = 0;
env = CPXopenCPLEX(&status);
//CPXreadcopyvmconfig(env, "distconfig.vmc");
lp = CPXcreateprob(env, &status, "dgeo");
CPXchgobjsen(env, lp, CPX_MIN);
// create model cols and rows
int cols = opt_atu * servers + 1;
double obj[cols];
double ub[cols];
char ctype[cols];
#ifdef LP_WITH_NAMED_VARS
char *cnames[cols];
#else
char **cnames = NULL;
#endif
for(int i = 0; i < opt_atu; i++) {
for(int s = 1; s <= servers; s++) {
int catu = i*servers + s-1;
obj[catu] = opt_data[i].comm[s];
ub[catu] = 1;
ctype[catu] = 'I'; // integer
#ifdef LP_WITH_NAMED_VARS
char *name = malloc(sizeof(char)*20);
sprintf(name, "map(%d,%d)", i, s);
cnames[catu] = name;
#endif
}
}
//makespan
obj[cols-1] = f;
ub[cols-1] = CPX_INFBOUND;
ctype[cols-1] = 'C'; // continuous
#ifdef LP_WITH_NAMED_VARS
cnames[cols-1] = "mksp";
#endif
status = CPXnewcols(env, lp, cols, obj, NULL, ub, ctype, cnames);
// rows - constraints: only one server
int oos_rows = opt_atu;
int oos_rowsnz = opt_atu * servers;
int oos_matbeg[oos_rows];
double oos_rhs[oos_rows];
char oos_sense[oos_rows];
int oos_matind[oos_rowsnz];
double oos_matval[oos_rowsnz];
for(int i = 0; i < opt_atu; i++) {
int begin = i*servers;
oos_matbeg[i] = begin;
oos_sense[i] = 'E';
oos_rhs[i] = 1.0;
for(int s = 1; s <= servers; s++) {
oos_matind[begin + s-1] = begin + s-1;
oos_matval[begin + s-1] = 1.0;
}
}
status = CPXaddrows(env, lp, 0, oos_rows, oos_rowsnz, oos_rhs,
oos_sense, oos_matbeg, oos_matind, oos_matval, NULL, NULL);
// rows - constraints: makespan
int mks_rows = servers;
int mks_rowsnz = (opt_atu+1) * servers;
int mks_matbeg[mks_rows];
double mks_rhs[mks_rows];
char mks_sense[mks_rows];
int mks_matind[mks_rowsnz];
double mks_matval[mks_rowsnz];
for(int s = 0; s < servers; s++) {
int begin = s * (opt_atu+1);
mks_matbeg[s] = begin;
mks_sense[s] = 'G';
mks_rhs[s] = 0; //agg_server[s+1].to_pnts;
for(int i = 0; i < opt_atu; i++) {
mks_matind[begin + i] = i*servers + s;
mks_matval[begin + i] = - opt_data[i].pnts;
}
mks_matind[begin + opt_atu] = cols-1;
mks_matval[begin + opt_atu] = 1.0;
}
status = CPXaddrows(env, lp, 0, mks_rows, mks_rowsnz, mks_rhs,
mks_sense, mks_matbeg, mks_matind, mks_matval, NULL, NULL);
// force makespan = fixmksp
/*double fixmksp = 32;
mks_matbeg[0] = 0;
mks_sense[0] = 'E';
mks_rhs[0] = fixmksp;
mks_matind[0] = cols-1;
mks_matval[0] = 1.0;
status = CPXaddrows(env, lp, 0, 1, 1, mks_rhs, mks_sense, mks_matbeg,
mks_matind, mks_matval, NULL, NULL);*/
// provide an initial solution
int mcnt = 1;
int nzcnt = opt_atu * servers;
int beg[mcnt]; beg[0] = 0;
int varindices[nzcnt];
double values[nzcnt];
int actual = 0;
for(int i = 0; i < opt_atu; i++) {
for(int s = 1; s <= servers; s++) {
int index = i*servers + s-1;
varindices[actual] = index;
histogram_cell *rcell = hr->get_cell(hr, opt_data[i].xl, opt_data[i].yl);
values[actual] = rcell->place == s ? 1.0 : 0.0;
actual++;
}
}
status = CPXaddmipstarts(env, lp, mcnt, nzcnt, beg, varindices, values, NULL, NULL);
// only root node
if (only_root_node)
status = CPXsetintparam(env, CPXPARAM_MIP_Limits_Nodes, 0);
// screen output
status = CPXsetintparam(env, 1035, CPX_ON);
// threads
status = CPXsetintparam(env, 1067, 10);
// stop at mip gap
status = CPXsetdblparam (env, CPXPARAM_MIP_Tolerances_MIPGap, (double)0.0005);
status = CPXsetdblparam (env, CPX_PARAM_WORKMEM, 60*1024.0); // at most 1G RAM
status = CPXsetintparam (env, CPX_PARAM_NODEFILEIND, 2); // write node files to disk, uncompressed
status = CPXsetintparam (env, CPX_PARAM_VARSEL, 2); // use strong branching
status = CPXsetintparam (env, CPX_PARAM_MIPEMPHASIS, 3); // Emphasize best bound
//status = CPXsetintparam (env, CPX_PARAM_MIPEMPHASIS, 1); // Emphasize feasibility
//status = CPXsetintparam (env, CPX_PARAM_MIPEMPHASIS, 4); // Emphasize hidden feasibility
// cuts
/*status = CPXsetintparam (env, CPX_PARAM_CLIQUES, 3);
status = CPXsetintparam (env, CPX_PARAM_COVERS, 3);
status = CPXsetintparam (env, CPX_PARAM_DISJCUTS, 3);
status = CPXsetintparam (env, CPX_PARAM_FLOWCOVERS, 2);
status = CPXsetintparam (env, CPX_PARAM_FLOWPATHS, 2);
status = CPXsetintparam (env, CPX_PARAM_FRACCUTS, 2);
status = CPXsetintparam (env, CPX_PARAM_GUBCOVERS, 2);
status = CPXsetintparam (env, CPX_PARAM_IMPLBD, 2);
status = CPXsetintparam (env, CPX_PARAM_MIRCUTS, 2);
status = CPXsetintparam (env, CPX_PARAM_MCFCUTS, 2);
status = CPXsetintparam (env, CPX_PARAM_ZEROHALFCUTS, 2);*/
// enable the search for alternative solutions
/*status = CPXsetintparam (env, CPX_PARAM_PREIND, 0); // disable presolve
status = CPXsetdblparam (env, CPX_PARAM_CUTSFACTOR, (double)1.0); // disable all cuts
status = CPXsetintparam (env, CPX_PARAM_VARSEL, 1); // branch on var with max infeasibility
*/
// optimize
status = CPXmipopt(env, lp);
//status = CPXdistmipopt(env, lp);
// get best objective bound
double best_objval;
status = CPXgetbestobjval(env, lp, &best_objval);
printf("\n\nBest bound objective value: %f\n", best_objval);
// print solutions in pool objective value
printf("%3s %-10s %15s %15s %10s\n", "Sol", "Name", "Best", "Objective", "Gap%");
int numsolns = CPXgetsolnpoolnumsolns (env, lp);
for(int i = 0; i < numsolns; i++) {
double objval;
char name[10];
int surplus;
CPXgetsolnpoolsolnname(env, lp, name, 10, &surplus, i);
status = CPXgetsolnpoolobjval (env, lp, i, &objval);
if (i == numsolns-1)
sprintf(name, "%s", "m1");
printf("%3d %-10s %15.2f %15.2f %10.2f\n", i, name, best_objval, objval, fabs(objval-best_objval)/objval*100);
}
printf("\n");
// char filename[100];
// sprintf(filename, "debug.lp", opt_atu);
// CPXwriteprob(env, lp, filename, NULL);
// fill map
int cur_numcols = CPXgetnumcols(env, lp);
double x[cur_numcols];
int solstat;
double objval;
status = CPXsolution(env, lp, &solstat, &objval, x, NULL, NULL, NULL);
printf("Status = %d, Solution status = %d, Objective value = %f\n", status,
solstat, objval);
int map[opt_atu][servers+1];
memset(map, 0, sizeof map);
if (only_root_node)
goto free_problem;
for(int cell = 0; cell < opt_atu; cell++) {
for(int server = 1; server <= servers; server++) {
int index = cell*servers + server-1;
map[cell][server] = round(x[index]);
}
}
//print_instance_and_solution_fo_file(opt_data, opt_atu, servers, map);
for(int cell = 0; cell < opt_atu; cell++) {
int used_server = 0;
for(int server = 1; server <= servers; server++) {
if (map[cell][server] == 1) {
used_server = server;
break;
}
}
assert(used_server > 0);
histogram_cell *rcell = hr->get_cell(hr, opt_data[cell].xl, opt_data[cell].yl);
rcell->place = used_server;
SET_IN_PLACE(rcell->copies, used_server);
for(int c = 0; c < opt_data[cell].rcells_size; c++) {
histogram_cell *rc = opt_data[cell].rcells[c].cell;
if (!IS_IN_PLACE(rc->copies, used_server)) {
SET_IN_PLACE(rc->copies, used_server);
}
}
histogram_cell *lc = opt_data[cell].lcell;
if (!IS_IN_PLACE(lc->copies, used_server)) {
SET_IN_PLACE(lc->copies, used_server);
}
}
double final_mkspan, final_comm;
double Zheur = get_sm_objective(hr, opt_data, opt_atu, f, servers, 1, NULL, NULL, &final_mkspan, &final_comm);
printf("LPI Z\tMkspan\tComm\nSM_SMI %.2f\t%.2f\t%.2f\n", Zheur, final_mkspan, final_comm);
free_problem:
// free problem
#ifdef LP_WITH_NAMED_VARS
for(int catu = 0; catu < cols-1; catu++)
free(cnames[catu]);
#endif
status = CPXfreeprob(env, &lp);
status = CPXcloseCPLEX(&env);
}