Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Approximate solution methods for the capacitated multi-facility Weber problem
AU - Boyaci, Burak
AU - Altinel, İ. Kuban
AU - Aras, Necat
PY - 2013/1
Y1 - 2013/1
N2 - This work considers the capacitated multi-facility Weber problem, which is concerned with locating m facilities and allocating their limited capacities to n customers in order to satisfy their demand at minimum total transportation cost. This is a non-convex optimization problem and difficult to solve. Therefore, approximate solution methods are proposed in this article. Some of them are based on the relaxation of the capacity constraints and apply the subgradient algorithm. The resulting Lagrangian subproblem is a variant of the well-known multi-facility Weber problem and can be solved using column generation and branch-and-price approach on a variant of the set covering formulation. Others are based on the approximating mixed-integer linear programming formulations obtained by exploiting norm properties and the alternate solution of the discrete location and transportation problems. The results of a detailed computational analysis are also reported.
AB - This work considers the capacitated multi-facility Weber problem, which is concerned with locating m facilities and allocating their limited capacities to n customers in order to satisfy their demand at minimum total transportation cost. This is a non-convex optimization problem and difficult to solve. Therefore, approximate solution methods are proposed in this article. Some of them are based on the relaxation of the capacity constraints and apply the subgradient algorithm. The resulting Lagrangian subproblem is a variant of the well-known multi-facility Weber problem and can be solved using column generation and branch-and-price approach on a variant of the set covering formulation. Others are based on the approximating mixed-integer linear programming formulations obtained by exploiting norm properties and the alternate solution of the discrete location and transportation problems. The results of a detailed computational analysis are also reported.
KW - Heuristics
KW - facility location allocation
KW - column generation
KW - Lagrangian relaxation
U2 - 10.1080/0740817X.2012.695100
DO - 10.1080/0740817X.2012.695100
M3 - Journal article
VL - 45
SP - 97
EP - 120
JO - IIE Transactions
JF - IIE Transactions
SN - 0740-817X
IS - 1
ER -