Discrete Location Problems  Benchmarks Library

---

Capacitated Facility Location Problem (CFLP) is generalization of the Simple Plant Location Problem. In contrast to that we now suppose each facility can product limited quantity of produce. It is importance and quite prevalent assumption. And although mathematical models of those problems not  very differ, but solving methods for CFLP are more difficult. The most efficient  methods for CFPL are Lagrangen relaxation methods and the matrix column generation method.

Now we discrabe the mathematical model as integer programming problem. Let a set I = {1,..., I} give potential facility locations by production some uniform product. The number c_i ³ 0 is the opening cost of facility at location  iI ,  V_i0 is the utmost value of prodaction at this location.

A set J ={1,…,J} assign clients that require service. For each pair (ij)  g_ij0 is the production and transportation costs and  p_ij0 is a value of product from fasility i needed to client j.

 Let us define the following notations:

Then the Capacitated Facility Location Problem may be written 

       

x_ij,  y_i {0, 1},  iI ,   jJ.  

    Литература

1. V. Beresnev, E. Gimadi, and V. Dement'ev Extremal Standartization Problems. Novosibirsk: Nauka, 1978. (in Russian)

2. Diaz J.A., Fernandez E. Column generation for the single source capacitated plant location problem. Technical report DR 2000/17, UPC Barcelona, 2000.

3. Sridharan R. The capacitated plant location problem. European Journal of Operational Research. v. 87 (1995), p. 203–213.

4. Holmberg K., Ronnqvist M., Yuan D. An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research. v113 (1999), p. 544–559.

Home Benchmarks Library