Capacitated Facility Location Problem两种解决方法和对比

Capacitated Facility Location Problem

问题描述

Suppose there are n facilities and m customers. We wish to choose:

1. which of the n facilities to open
2. the assignment of customers to facilities
3. The objective is to minimize the sum of the opening cost and the assignment cost.
4. The total demand assigned to a facility must not exceed its capacity

问题建模

设集合 $I$ = { 1, … , m } 是所有Facilities

集合 $J$ = { 1, …, n } 是所有Customers

对于每个Customer 都有一个 demand, $d_j$，只能被一个facility提供

对于每个Facility 都有一个 capacity, $b_i$，是该facility最多能提供的容量

对于每个Facility 都有一个 fixed cost, $f_i$，当该facility开启的时候固定的开销

定义 $c_{ij}$ 是facility $j$满足 customer $i$ 的要求的开销

对于每个facility $i\in I$，定义变量 $y_i$

$$y_i=\{\begin{array}{llc}1& 如果facility& i开启\\ 0& 如果facility& i关闭\end{array}$$

对于每个facility $i\in I$，每个customer $j\in J$， 定义变量 $x_{ij}$

$$x_{ij}=\{\begin{array}{llcc}1& 如果customer& i被facility& j服务\\ 0& 否则& & \end{array}$$

对于Single Source Capacitated Facility Location Problemk可以描述为如下

$$\min \sum _{i\in I}\sum _{j\in J}{c}_{ij}{x}_{ij}+\sum _{i\in I}{f}_i{y}_i\text{\hspace{1em}(1)}$$

$$\sum _{i\in I}{x}_{ij}=1\forall j\in J\text{\hspace{1em}(2)}$$

(3)∑j∈Jdjxij≤biyi∀i∈I\sum_{j \in J}d_jx_{ij}\leq b_iy_i\quad\forall i \in I \tag3