Using scenario trees and progressive hedging for stochastic inventory routing problems

DOI10.1007/s10732-008-9076-0zbMath1176.90025MaRDI QIDQ1044243

Lars Magnus Hvattum, Arne Løkketangen

Publication date: 11 December 2009

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-008-9076-0

zbMATH Keywords

heuristic; scenario tree; progressive hedging; stochastic inventory routing

Mathematics Subject Classification ID

90B05: Inventory, storage, reservoirs

90C40: Markov and semi-Markov decision processes

Related Items

A stochastic programming approach for chemotherapy appointment scheduling, A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands, A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands, Stochastic inventory routing with time-based shipment consolidation, Stochastic forestry planning under market and growth uncertainty, A maritime inventory routing problem with stochastic sailing and port times, Recent trends in metaheuristics for stochastic combinatorial optimization, A survey on metaheuristics for stochastic combinatorial optimization, The dynamic bowser routing problem, Optimization of a two-echelon location lot-sizing routing problem with deterministic demand, BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs, Managing congestion in a multi-modal transportation network under biomass supply uncertainty, The sample average approximation method for empty container repositioning with uncertainties, Scenario-based learning for stochastic combinatorial optimisation, Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem, Scheduled service network design with quality targets and stochastic travel times, Industrial aspects and literature survey: Combined inventory management and routing, PySP: modeling and solving stochastic programs in Python, An inventory-routing problem with the objective of travel time minimization, A Progressive Hedging Approach for Surgery Planning Under Uncertainty, Progressive hedging-based metaheuristics for stochastic network design, Benders Decomposition for Production Routing Under Demand Uncertainty

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applying the progressive hedging algorithm to stochastic generalized networks
• Layering strategies for creating exploitable structure in linear and integer programs
• Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
• The Vehicle Routing Problem
• Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems
• Oil field optimization under price uncertainty
• A Combined Vehicle Routing and Inventory Allocation Problem
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• An Integrated Inventory Allocation and Vehicle Routing Problem
• Solving multistage stochastic networks: An application of scenario aggregation
• The Stochastic Inventory Routing Problem with Direct Deliveries
• A Price-Directed Approach to Stochastic Inventory/Routing
• Inventory routing problems: a logistical overview
• Progressive hedging as a meta-heuristic applied to stochastic lot-sizing