TY - GEN
T1 - A Lagrangean Relaxation Approach for a Two-Stage Capacitated Facility Location Problem with Choice of Facility Size
AU - Wu, Tingying
AU - Chu, Feng
AU - Yang, Zhen
AU - Zhou, Zhili
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2016/1/12
Y1 - 2016/1/12
N2 - In this paper, we study a two-stage capacitated facility location problem with choice of facility size. Given a set of potential sites for plants and a set of potential sites for depots, each of the plants and the depots has several possible sizes, and a set a customers with demands, the aim of the problem is to determine the locations of the plants and the depots as well as their sizes, the product flows from the opened plants, via the opened depots to the customers under the single-sourcing constraints, so that all of the customers' demands are satisfied with the minimum sum of the fixed opening costs of the facilities, the producing costs at the plants, the handling costs at the depots, the transportation costs from the plants to the depots and the customer-depot assignment costs. A mixed integer programming model for the problem is formulated and a LaGrange an relaxation approach is proposed to achieve a lower bound and an upper bound of the problem. The performance of the LaGrange an relaxation approach is evaluated on 200 randomly generated instances. The computational results demonstrate that the LaGrange an relaxation approach is effective with the average gaps around 1.30%.
AB - In this paper, we study a two-stage capacitated facility location problem with choice of facility size. Given a set of potential sites for plants and a set of potential sites for depots, each of the plants and the depots has several possible sizes, and a set a customers with demands, the aim of the problem is to determine the locations of the plants and the depots as well as their sizes, the product flows from the opened plants, via the opened depots to the customers under the single-sourcing constraints, so that all of the customers' demands are satisfied with the minimum sum of the fixed opening costs of the facilities, the producing costs at the plants, the handling costs at the depots, the transportation costs from the plants to the depots and the customer-depot assignment costs. A mixed integer programming model for the problem is formulated and a LaGrange an relaxation approach is proposed to achieve a lower bound and an upper bound of the problem. The performance of the LaGrange an relaxation approach is evaluated on 200 randomly generated instances. The computational results demonstrate that the LaGrange an relaxation approach is effective with the average gaps around 1.30%.
KW - Facility location
KW - Facility size
KW - Heuristic
KW - Lagrangean relaxation
UR - https://www.scopus.com/pages/publications/84964494362
U2 - 10.1109/SMC.2015.134
DO - 10.1109/SMC.2015.134
M3 - 会议稿件
AN - SCOPUS:84964494362
T3 - Proceedings - 2015 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015
SP - 713
EP - 718
BT - Proceedings - 2015 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015
Y2 - 9 October 2015 through 12 October 2015
ER -