Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems

DOI10.1287/ijoc.1080.0291zbMath1243.90015MaRDI QIDQ2901065

Lars Magnus Hvattum, Gilbert Laporte, Arne Løkketangen

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1080.0291

zbMATH Keywords

inventory; routing; scenario; stochastic heuristic

Mathematics Subject Classification ID

90C15: Stochastic programming

90B05: Inventory, storage, reservoirs

Related Items

A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands, Heuristics for dynamic and stochastic inventory-routing, A maritime inventory routing problem with stochastic sailing and port times, Using scenario trees and progressive hedging for stochastic inventory routing problems, The dynamic bowser routing problem, Optimization of a two-echelon location lot-sizing routing problem with deterministic demand, Large scale stochastic inventory routing problems with~split delivery and service level constraints, Industrial aspects and literature survey: Combined inventory management and routing, An inventory-routing problem with the objective of travel time minimization, Benders Decomposition for Production Routing Under Demand Uncertainty