Discrete location problemsBenchmark library

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, (rline by line_{ij})^{[1]},pline by line,_{ij}f_{i }, g_{i}.

^{[1]}for example, elements of 2x2-matrixAwill be ordered as follows:a_{11},a_{12},a_{21},a_{22}.

Instances' codes have the following meaning: R2r-01 — instance from class R2r, unique number 01.

Instance code

UB

VL^{*}

x^{*}74

13

10 12 16 21 24

78

28

8 10 16

41

14

6 8 12 20 23

48

8

10 23

62

18

10 16 22

62

31

1 6 12 15 18 21

72

23

8 12 16 21

45

12

2 18

73

22

8 15 18 20 24

52

18

4 18 20 24

78

16

10 16 20 22

61

10

4 11 16 18

56

28

6 10 16 22 24

57

19

8 16 19

46

7

2 20 22

55

21

14 22 24

57

20

6 9 10 16 21

69

32

4 8 12 20 24

65

30

4 5 10 20 22

64

21

12 16 19 22

64

19

2 4 22

76

12

4 10 18 21 24

52

23

6 10 22

47

14

14 20

78

16

10 16 20 22