Enhancing Benders decomposition algorithm to solve a combat logistics problem

DOI10.1007/S00291-019-00571-YMaRDI QIDQ2178915zbMATH OpenOpenAlexWikidataFDO

Authors Mohammad Marufuzzaman, Farjana Nur, Amy E. Bednar, Mark Cowan

Publication date 11 May 2020

Published in OR Spectrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00291-019-00571-y

zbMATH Keywords

Benders decomposition algorithmcombat logisticsinput orderingmean-value cutmulti-cutShapley ruleShapley value

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Linear programming (90C05) Mixed integer programming (90C11) Stochastic programming (90C15)

Recommendations

• Accelerating the Benders decomposition method: application to stochastic network design problems
• Accelerating Benders decomposition: multiple cuts via multiple solutions
• Benders decomposition for large-scale uncapacitated hub location
• Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
• The Benders decomposition algorithm: a literature review

Cites work

• A branch and bound method for stochastic global optimization
• A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution
• A dynamic distribution model for combat logistics.
• A multicut algorithm for two-stage stochastic linear programs
• A stochastic programming approach for supply chain network design under uncertainty
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Approximate dynamic programming for the dispatch of military medical evacuation assets
• Distribution network design on the battlefield
• Efficient symmetry breaking formulations for the job grouping problem
• Local branching
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• On optimal allocation of indivisibles under uncertainty
• Operating room pooling and parallel surgery processing under uncertainty
• Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming
• Optimization of transportation requirements in the deployment of military units
• Optimizing the US Navy's combat logistics force
• Partitioning procedures for solving mixed-variables programming problems
• Practical enhancements to the Magnanti-Wong method
• Supply chain design under uncertainty using sample average approximation and dual decomposition
• The sample average approximation method applied to stochastic routing problems: a computational study
• The sample average approximation method for stochastic discrete optimization

Cited in

(3)

• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
• Accelerating the Benders decomposition method: application to stochastic network design problems
• Application of decomposition techniques in a wildfire suppression optimization model

Describes a project that uses

Uses Software

• GAMS

This page was built for publication: Enhancing Benders decomposition algorithm to solve a combat logistics problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178915)