A subgradient-based branch-and-bound algorithm for the ...

D Test problem generator
In the following, we reproduce the C-code used for generating the test problem
instances.
/*----------------------------------------------------------------*/
/* FILE : gencflp .c */
/* VERSION : 1.0 */
/* DATE : July 13 , 2000 */
/* AUTHOR : Andreas Klose */
/* SUBJECT : program to generate CFLP test problems */
/*----------------------------------------------------------------*/
/* USAGE : gencflp */
/* */
/* where " inputfile " is an ascii file providing the following */
/* information on how to generate the test instances : */
/* (1) Seed , that is an integer number specifying the seed to be */
*/ used for the random number generator (if Seed =0 then a seed */
/* is generated automatically ) */
/* (2) for every problem class : */
/* # customers # depot sites ratio problem name */
/* where ratio is the desired ratio of total capacity to total */
/* total demand . */
/* The second argument "path ‘‘ is an optional and should specify */
/* the output path */
/*----------------------------------------------------------------*/
# include
# include
# include
# include
# include
long unifRand ( long m);
/* returns uniform integer random number in [0 ,m). See file rnd .c */
double URand ();
/* returns uniform real random number in [0 ,1). See file rnd .c */
/*----------------------------------------------------------------*/
int m,n,num ; /* number of customers , depots , instances */
int *f, *d, *s; /* fixed depot costs , demands and capacities */
int *x, *y; /* coordinates */
int totd , totc ; /* total demand and total capacity */
char name [512]; /* problem name */
char fname [512]; /* name of file where to store problem data */
double r; /* r = totc / totd */
time_t tt;
/*----------------------------------------------------------------*/
void gencusts ( void ) {
/* Generate customers with demand 5 + u [0 ,30] */
int i;
totd = 0;
for (i =0;i