int mpp_test(sym_environment *env)
{
int termcode, i, file_num = 1;
char input_files[2][MAX_FILE_NAME_LENGTH +1] = {"sample.mpp"};
double sol[1] = {70.00};
char *input_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1));
char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1));
double *obj_val = (double *)calloc(DSIZE,file_num);
double tol = 1e-03;
mpp_problem *mpp = (mpp_problem *) env->user;
if (strcmp(mpp->par.test_dir, "") == 0){
strcpy(input_dir, ".");
} else{
strcpy(input_dir, mpp->par.test_dir);
}
sym_set_int_param(env, "verbosity", -10);
for(i = 0; i<file_num; i++){
strcpy(infile, "");
sprintf(infile, "%s%s%s", input_dir, "/", input_files[i]);
strcpy(mpp->par.infile, infile);
CALL_FUNCTION( sym_load_problem(env) );
printf("Solving %s...\n", input_files[i]);
CALL_FUNCTION( sym_solve(env) );
sym_get_obj_val(env, &obj_val[i]);
if((obj_val[i] < sol[i] + tol) &&
(obj_val[i] > sol[i] - tol)){
printf("Success!\n");
} else {
printf("Failure!(%f, %f) \n", obj_val[i], sol[i]);
}
if(env->mip->n && i + 1 < file_num){
free_master_u(env);
strcpy(env->par.infile, "");
env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc));
}
}
mpp->par.test = FALSE;
FREE(input_dir);
FREE(infile);
FREE(obj_val);
return(0);
}
int vrp_test(sym_environment *env, int argc, char **argv)
{
int termcode, i, file_num = 34;
char input_files[34][MAX_FILE_NAME_LENGTH +1] = {"A/A-n34-k5",
"A/A-n32-k5",
"A/A-n33-k5",
"E/E-n13-k4",
"E/E-n22-k4",
"E/E-n23-k3",
"E/E-n30-k3",
"E/E-n33-k4",
"V/att-n48-k4",
"E/E-n51-k5",
"A/A-n33-k6",
"A/A-n36-k5",
"A/A-n37-k5",
"A/A-n38-k5",
"A/A-n39-k5",
"A/A-n39-k6",
"A/A-n45-k6",
"A/A-n46-k7",
"B/B-n31-k5",
"B/B-n34-k5",
"B/B-n35-k5",
"B/B-n38-k6",
"B/B-n39-k5",
"B/B-n41-k6",
"B/B-n43-k6",
"B/B-n44-k7",
"B/B-n45-k5",
"B/B-n50-k7",
"B/B-n51-k7",
"B/B-n52-k7",
"B/B-n56-k7",
"B/B-n64-k9",
"A/A-n48-k7",
"A/A-n53-k7"};
double sol[34] = {778, 784, 661, 247, 375, 569, 534, 835, 40002, 521, 742,
799, 669, 730, 822, 831, 944, 914, 672, 788, 955, 805,
549, 829, 742, 909, 751, 741, 1032, 747, 707, 861,
1073, 1010};
char *input_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1));
char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1));
char *sgfile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1));
double *obj_val = (double *)calloc(DSIZE,file_num);
double tol = 1e-06, ub;
vrp_problem *vrp = (vrp_problem *) env->user;
if (strcmp(vrp->par.test_dir, "") == 0){
strcpy(input_dir, "../../../VRPLIB");
} else{
strcpy(input_dir, vrp->par.test_dir);
}
for(i = 0; i<file_num; i++){
strcpy(infile, "");
strcpy(sgfile, "");
sprintf(infile, "%s%s%s%s", input_dir, "/", input_files[i], ".vrp");
sprintf(sgfile, "%s%s%s", "./small_graph/", input_files[i], ".sg");
strcpy(vrp->par.infile, infile);
strcpy(vrp->par.small_graph_file, sgfile);
vrp->par.use_small_graph = LOAD_SMALL_GRAPH;
sym_load_problem(env);
sym_find_initial_bounds(env);
printf("Solving %s...\n", input_files[i]);
sym_solve(env);
sym_get_obj_val(env, &obj_val[i]);
if((obj_val[i] < sol[i] + tol) &&
(obj_val[i] > sol[i] - tol)){
printf("Success!\n");
} else {
printf("Failure!(%f, %f) \n", obj_val[i], sol[i]);
}
if(i+1 < file_num){
sym_close_environment(env);
env = sym_open_environment();
sym_parse_command_line(env, argc, argv);
}
}
return (0);
}
