The Capacitated Facility Location Problem

These data files are Test Bed C in:

Guastaroba G. and Speranza M.G., Kernel Search for the Capacitated Facility Location Problem, Journal of Heuristics, 18(6), 877-917, 2012.

There are currently 150 data files. The format of these data files is:

|J| |I| d₁ d₂ d₃ … d_|I|

s₁ s₂ s₃ … s_|J|

f₁ f₂ f₃ … f_|J|

c₁₁ c₂₁ c₃₁ … c_|I|1 c₁₂ c₂₂ c₃₂ … c_|I|2 … c_1|J| c_2|J| c_3|J| … c_|I||J|

where:

|J| is the number of potential facility locations;

|I| is the number of customers;

d_i (i=1,...,|I|) is the demand of customer i;

s_j (j=1,...,|J|) is the capacity of facility j;

f_j (j=1,...,|J|) is the fixed cost of opening facility j;

c_ij (i=1,...,|I|), (j=1,...,|J|) is the cost of supplying one unit of demand of customer i from facility j.

Instances are compressed with Winrar. To extract them you need to have Winrar installed. You can download a trial version here.

800 (facilities) × 4400 (customers) instances: 800_4400.rar

1000 × 1000 instances: 1000_1000.rar

1000 × 4000 instances: 1000_4000.rar

1200 × 3000 instances: 1200_3000.rar

2000 × 2000 instances: 2000_2000.rar