Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic

DOI10.1016/j.ejor.2016.02.040zbMath1346.90093OpenAlexW2300715002WikidataQ58644295 ScholiaQ58644295MaRDI QIDQ323187

Teodor Gabriel Crainic, Walter Rei, Luca Gobbato, Guido Perboli

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.040

zbMATH Keywords

uncertaintystochastic programminglogistics capacity planningprogressive hedgingstochastic variable cost and size bin packing

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty, A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times, Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning, Cutting and packing problems under uncertainty: literature review and classification framework, A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands, The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities, A machine learning optimization approach for last-mile delivery and third-party logistics, Stochastic forestry planning under market and growth uncertainty, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, A generalized bin packing problem for parcel delivery in last-mile logistics, Scheduled service network design with quality targets and stochastic travel times, A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches, Solving robust bin-packing problems with a branch-and-price approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
• The stochastic generalized bin packing problem
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• New bin packing fast lower bounds
• Supplier selection and order lot sizing modeling: a review
• Analyzing the quality of the expected value solution in stochastic programming
• Solving the variable size bin packing problem with discretized formulations
• The multi-Handler knapsack problem under uncertainty
• Progressive hedging-based metaheuristics for stochastic network design
• Coordination Mechanisms for a Distribution System with One Supplier and Multiple Retailers
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• On the online bin packing problem
• Synchronized production–distribution planning in a single-plant multi-destination network
• Analysis of practical policies for a single link distribution system
• The value of the stochastic solution in stochastic linear programs with fixed recourse
• Introduction to Stochastic Programming
• Stability analysis of portfolio management with conditional value-at-risk