Abstract
We investigate a logistics facility location problem to determine whether the existing facilities remain open or not, what the expansion size of the open facilities should be and which potential facilities should be selected. The problem is formulated as a mixed integer linear programming model (MILP) with the objective to minimize the sum of the savings from closing the existing facilities, the expansion costs, the fixed setup costs, the facility operating costs and the transportation costs. The structure of the model motivates us to solve the problem using Benders decomposition algorithm. Three groups of valid inequalities are derived to improve the lower bounds obtained by the Benders master problem. By separating the primal Benders subproblem, different types of disaggregated cuts of the primal Benders cut are constructed in each iteration. A high density Pareto cut generation method is proposed to accelerate the convergence by lifting Pareto-optimal cuts. Computational experiments show that the combination of all the valid inequalities can improve the lower bounds significantly. By alternately applying the high density Pareto cut generation method based on the best disaggregated cuts, the improved Benders decomposition algorithm is advantageous in decreasing the total number of iterations and CPU time when compared to the standard Benders algorithm and optimization solver CPLEX, especially for large-scale instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238–252.
Cordeau, J. F., Pasin, F., & Solomon, M. M. (2006). An integrated model for logistics network design. Annals of Operations Research, 144(1), 59–82.
Cote, G., & Laughton, M. (1984). Large-scale mixed integer programming: Benders-type heuristics. European Journal of Operational Research, 16(3), 327–333.
Dogan, K., & Goetschalckx, M. (1999). A primal decomposition method for the integrated design of multi-period production-distribution systems. IIE Transactions, 31(11), 1027–1036.
Erengüç, S. S., Simpson, N. C., & Vakharia, A. J. (1999). Integrated production-distribution planning in supply chains: an invited review. European Journal of Operational Research, 115(2), 219–236.
Fond, C. O., & Srinivasan, V. (1986). The multiregion dynamic capacity expansion problem: an improved heuristic. Management Science, 32(9), 1140–1152.
Gabrel, V., Knippel, A., & Minoux, M. (1999). Exact solution of multicommodity network optimization problems with general step cost functions. Operations Research Letters, 25(1), 15–23.
Gendreau, M., Potvin, J. Y., Smires, A., & Soriano, P. (2006). Multi-period capacity expansion for a local access telecommunications network. European Journal of Operational Research, 172(3), 1051–1066.
Geoffrion, A. M., & Graves, G. W. (1974). Multicommodity distribution system design by Benders decomposition. Management Science, 20(5), 822–844.
Hindi, K. S., & Basta, T. (1994). Computationally efficient solution of a multiproduct, two-stage distribution-location problem. Journal of the Operational Research Society, 45(11), 1316–1323.
Klose, A. (2000). A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem. European Journal of Operational Research, 126(2), 408–421.
Ko, H. J., & Evans, G. W. (2007). A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs. Computers & Operations Research, 34(2), 346–366.
Magnanti, T. L., & Wong, R. T. (1981). Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Operations Research, 29(3), 464–484.
McDaniel, D., & Devine, M. (1977). A modified Benders’ partitioning algorithm for mixed integer programming. Management Science, 24(3), 312–319.
Melo, M. T., Nickel, S., & Saldanha-da-Gama, F. (2009). Facility location and supply chain management—a review. European Journal of Operational Research, 196(2), 401–412.
Minoux, M. (2001). Discrete cost multicommodity network optimization problems and exact solution methods. Annals of Operations Research, 106, 19–46.
Papadakos, N. (2008). Practical enhancements to the Magnanti-Wong method. Operations Research Letters, 36(4), 444–449.
Poojari, C. A., & Beasley, J. E. (2009). Improving Benders decomposition using a genetic algorithm. European Journal of Operational Research, 199(1), 89–97.
Rei, W., Cordeau, J. F., Gendreau, M., & Soriano, P. (2009). Accelerating Benders decomposition by local branching. INFORMS Journal on Computing, 21(2), 333–345.
Saharidis, G. K. D., Boile, M., & Theofanis, S. (2011). Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems. Expert Systems with Applications, 38(6), 6627–6636.
Saharidis, G. K. D., & Ierapetritou, M. G. (2010). Improving Benders decomposition using maximum feasible sub-system (MFS) cut generation strategy. Computers & Chemical Engineering, 34(8), 1237–1245.
Saharidis, G. K. D., Minoux, M., & Ierapetritou, M. G. (2010). Accelerating Benders method using covering cut bundle generation. International Transactions in Operational Research, 17(2), 221–237.
Singh, P., Makram, E. B., & Adams, W. P. (1998). A new technique for optimal time-dynamic distribution substation and feeder planning. Electric Power Systems Research, 47(3), 197–204.
Üster, H., Easwaran, G., Akçali, E., & Çetinkaya, S. (2007). Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model. Naval Research Logistics, 54(8), 890–907.
Wentges, P. (1996). Accelerating Benders’ decomposition for the capacitated facility location problem. Mathematical Methods of Operations Research, 44(2), 267–290.
Yilmaz, P., & Catay, B. (2006). Strategic level three-stage production distribution planning with capacity expansion. Computers & Industrial Engineering, 51(4), 609–620.
Acknowledgements
This research is partly supported by State Key Program of National Natural Science Foundation of China (71032004), the 111 Project under Grant B08015, Federal Project and (9901011) research project of Kathikas Institute of Research and Technology (KIRT), Cyprus.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tang, L., Jiang, W. & Saharidis, G.K.D. An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions. Ann Oper Res 210, 165–190 (2013). https://doi.org/10.1007/s10479-011-1050-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-1050-9