An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
Lixin Tang (),
Wei Jiang and
Georgios Saharidis
Annals of Operations Research, 2013, vol. 210, issue 1, 165-190
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. Copyright Springer Science+Business Media, LLC 2013
Keywords: Facility location; Existing facility expansion; Establishment of new facilities; Benders decomposition; Valid inequalities; Disaggregated cuts; High density Pareto cuts (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (25)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-1050-9 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:210:y:2013:i:1:p:165-190:10.1007/s10479-011-1050-9
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-011-1050-9
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().