Meta partial Benders decomposition for the logistics service network design problem
From MaRDI portal
Publication:2116853
DOI10.1016/J.EJOR.2021.07.056zbMATH Open1495.90015arXiv2009.14628OpenAlexW3187408980MaRDI QIDQ2116853FDOQ2116853
Authors: Simon Belieres, Mike Hewitt, Nicolas Jozefowiez, F. Semet 
Publication date: 18 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Abstract: Supply chain transportation operations often account for a large proportion of product total cost to market. Such operations can be optimized by solving the Logistics Service Network Design Problem (LSNDP), wherein a logistics service provider seeks to cost-effectively source and fulfill customer demands of products within a multi-echelon distribution network. However, many industrial settings yield instances of the LSNDP that are too large to be solved in reasonable run-times by off-the-shelf optimization solvers. We introduce an exact Benders decomposition algorithm based on partial decompositions that strengthen the master problem with information derived from aggregating subproblem data. More specifically, the proposed Meta Partial Benders Decomposition intelligently switches from one master problem to another by changing both the amount of subproblem information to include in the master as well as how it is aggregated. Through an extensive computational study, we show that the approach outperforms existing benchmark methods and we demonstrate the benefits of dynamically refining the master problem in the course of a partial Benders decomposition-based scheme.
Full work available at URL: https://arxiv.org/abs/2009.14628
Recommendations
- A Benders decomposition-based approach for logistics service network design
- Logic-based benders decomposition for an inter-modal transportation problem
- Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- Subgradient Methods for the Service Network Design Problem
- Benders decomposition for capacitated network design
- An improved Benders decomposition applied to a multi-layer network design problem
- A new Lagrangian-Benders approach for a concave cost supply chain network design problem
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Partitioning procedures for solving mixed-variables programming problems
- Accelerating Benders decomposition by local branching
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An integrated model for logistics network design
- Facility location and supply chain management. A review
- Logistics network design with supplier consolidation hubs and multiple shipment options
- Service network design in freight transportation
- Service network design for freight transportation: a review
- A survey on Benders decomposition applied to fixed-charge network design problems
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- The Benders decomposition algorithm: a literature review
- Accelerating Benders decomposition with heuristic master problem solutions
- A Benders decomposition-based approach for logistics service network design
Cited In (1)
This page was built for publication: Meta partial Benders decomposition for the logistics service network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116853)
