Capacitated Facility Location Problem
 
 
Test beds used in 
P. Avella, M. Boccia, A. Sforza, I. Vasil’ev 
"An effective heuristic for large-scale Capacitated Plant Location problems" 
revised version submitted for publication in Journal of Heuristics.
 
 
 
  Test bed A Test bed B
 

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

1000 × 1000 instances: 1000_1000.rar 1000_1000.rar

1000 × 4000 instances: 1000_4000.rar 1000_4000.rar

1200 × 3000 instances: 1200_3000.rar 1200_3000.rar

2000 × 2000 instances: 2000_2000.rar 2000_2000.rar

 
 
 
The format of data files is:
 
m n
 
d1 d2 d3  … dn
 
u1 u2 u3  … um
 
f1 f2 f3 … fm
 
c11 c12 c13 … c1n 
c21 c22 c23 … c2n 
… … … … …
cm1 cm2 cm3 … cmn 
 
 
where:
 
- m is the number of potential warehouse locations;
 
- n is the number of customers;
 
- dj (j=1,...,n) is the demand of j-th client;
 
- ui (i=1,...,m) is the capacity of i-th facility;
 
- fi (i=1,...,m) is the fixed cost of opening i-th facility;
 
- cij (i=1,...,m), (j=1,...,n) is the cost of sending one unit of demand from the i-th facility to the j-th client.