An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions

Annals of Operations Research

Volumn 210, Issue 1, 2013, Pages 165-190

  Tang, Lixin ^a   Jiang, Wei ^a   Saharidis, Georgios K D ^b,c  

^a NORTHEASTERN UNIVERSITY   (China)

^b UNIVERSITY OF THESSALY   (Greece)

^c Kathikas Institute of Research and Technology   (United States)

Author keywords

Benders decomposition; Disaggregated cuts; Establishment of new facilities; Existing facility expansion; Facility location; High density Pareto cuts; Valid inequalities

Indexed keywords

EID: 84886730015     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-011-1050-9     Document Type: Article

References (26)

1. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252.
2. Cordeau, J. F., Pasin, F., & Solomon, M. M. (2006). An integrated model for logistics network design. Annals of Operations Research, 144(1), 59-82.
3. Cote, G., & Laughton, M. (1984). Large-scale mixed integer programming: Benders-type heuristics. European Journal of Operational Research, 16(3), 327-333.
4. 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.
5. 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.
6. Fond, C. O., & Srinivasan, V. (1986). The multiregion dynamic capacity expansion problem: an improved heuristic. Management Science, 32(9), 1140-1152.
7. 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.
8. 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.
9. Geoffrion, A. M., & Graves, G. W. (1974). Multicommodity distribution system design by Benders decomposition. Management Science, 20(5), 822-844.
10. 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.
11. 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.
12. 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.
13. Magnanti, T. L., & Wong, R. T. (1981). Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Operations Research, 29(3), 464-484.
14. McDaniel, D., & Devine, M. (1977). A modified Benders' partitioning algorithm for mixed integer programming. Management Science, 24(3), 312-319.
15. 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.
16. Minoux, M. (2001). Discrete cost multicommodity network optimization problems and exact solution methods. Annals of Operations Research, 106, 19-46.
17. Papadakos, N. (2008). Practical enhancements to the Magnanti-Wong method. Operations Research Letters, 36(4), 444-449.
18. Poojari, C. A., & Beasley, J. E. (2009). Improving Benders decomposition using a genetic algorithm. European Journal of Operational Research, 199(1), 89-97.
19. Rei, W., Cordeau, J. F., Gendreau, M., & Soriano, P. (2009). Accelerating Benders decomposition by local branching. INFORMS Journal on Computing, 21(2), 333-345.
20. 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.
21. 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.
22. 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.
23. 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.
24. Ü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.
25. Wentges, P. (1996). Accelerating Benders' decomposition for the capacitated facility location problem. Mathematical Methods of Operations Research, 44(2), 267-290.
26. Yilmaz, P., & Catay, B. (2006). Strategic level three-stage production distribution planning with capacity expansion. Computers & Industrial Engineering, 51(4), 609-620.