Discrete location problems Benchmark library

Competitive facility location problem

Main page (Rus | Eng)   Competitive facility location problem

Test instances. Class R2r

For this class of instances the set of candidate sites and the set of clients are equal to the set of vertices of the graph shown on the Fig. 1. m = n = 25. Length of edges are random variables uniformly distributed on [0, 0.1] and are different for each instance. Clients' preferences are determened with distances in the graph. Facility with lower number is more preferable in the case of tie. Value p_ij is equal to b_j for all i.
Parameters' values are random integer from following intervals:
b_j from [6,12];
f_i from [25,30];
g_i from [15,20].
Input data format:
each string contains only one value;
parameters are given in the following order: m, n, (r_ij) line by line^[1], p_ij line by line, f_i , g_i.
^[1] for example, elements of 2x2-matrix A will be ordered as follows: a₁₁, a₁₂, a₂₁, a₂₂.
Instances' codes have the following meaning: R2r-01 — instance from class R2r, unique number 01.

 

Instance code	UB	VL*	x*
R2r-01	74	13	10 12 16 21 24
R2r-02	78	28	8 10 16
R2r-03	41	14	6 8 12 20 23
R2r-04	48	8	10 23
R2r-05	62	18	10 16 22
R2r-06	62	31	1 6 12 15 18 21
R2r-07	72	23	8 12 16 21
R2r-08	45	12	2 18
R2r-09	73	22	8 15 18 20 24
R2r-10	52	18	4 18 20 24
R2r-11	78	16	10 16 20 22
R2r-12	61	10	4 11 16 18
R2r-13	56	28	6 10 16 22 24
R2r-14	57	19	8 16 19
R2r-15	46	7	2 20 22
R2r-16	55	21	14 22 24
R2r-17	57	20	6 9 10 16 21
R2r-18	69	32	4 8 12 20 24
R2r-19	65	30	4 5 10 20 22
R2r-20	64	21	12 16 19 22
R2r-21	64	19	2 4 22
R2r-22	76	12	4 10 18 21 24
R2r-23	52	23	6 10 22
R2r-24	47	14	14 20
R2r-25	78	16	10 16 20 22
All instances R2r