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

DOI10.1007/s10479-011-1050-9zbMath1284.90035OpenAlexW2094252279MaRDI QIDQ2442081

Lixin Tang, Wei Jiang, Georges K. Saharidis

Publication date: 31 March 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1050-9

zbMATH Keywords

facility locationvalid inequalitiesBenders decompositiondisaggregated cutsestablishment of new facilitiesexisting facility expansionhigh density Pareto cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (20)

Supply–demand hub in industrial clusters: a stochastic approach ⋮ Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition ⋮ Integrated strategic and tactical supply chain planning with price-sensitive demands ⋮ Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ A chance-constraint optimization model for a multi-echelon multi-product closed-loop supply chain considering brand diversity: an accelerated Benders decomposition algorithm ⋮ Accelerating Benders decomposition: multiple cuts via multiple solutions ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ Recovery strategies from major supply disruptions in single and multiple sourcing networks ⋮ An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming ⋮ The stochastic capacitated branch restructuring problem ⋮ The Benders decomposition algorithm: a literature review ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ An L-shaped method with strengthened lift-and-project cuts ⋮ Acceleration strategies of Benders decomposition for the security constraints power system expansion planning

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Large-scale mixed integer programming: Benders-type heuristics
• A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs
• An integrated model for logistics network design
• Practical enhancements to the Magnanti-Wong method
• Facility location and supply chain management. A review
• Improving Benders decomposition using a genetic algorithm
• Partitioning procedures for solving mixed-variables programming problems
• Exact solution of multicommodity network optimization problems with general step cost functions
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
• Discrete cost multicommodity network optimization problems and exact solution methods
• Integrated production/distribution planning in supply chains: An invited review
• Multi-period capacity expansion for a local access telecommunications network
• Accelerating Benders Decomposition by Local Branching
• Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model
• Accelerating Benders method using covering cut bundle generation
• The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Multicommodity Distribution System Design by Benders Decomposition
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming

This page was built for publication: An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions