Heuristics for dynamic and stochastic inventory-routing

DOI10.1016/J.COR.2014.07.001zbMath1348.90024OpenAlexW2039638040MaRDI QIDQ337178

Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.07.001

zbMATH Keywords

heuristicstochastic demandinventory-routingdynamic demandrolling horizon algorithm

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (25)

On the effect of using sensors and dynamic forecasts in inventory-routing problems ⋮ The two-echelon multi-depot inventory-routing problem ⋮ A variable neighborhood search for the multi-period collection of recyclable materials ⋮ Benders Decomposition for Production Routing Under Demand Uncertainty ⋮ Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment ⋮ A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines ⋮ Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem ⋮ A mathematical programming-based heuristic for the production routing problem with transshipments ⋮ Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands ⋮ Long‐term effects of short planning horizons for inventory routing problems ⋮ Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery ⋮ Stochastic inventory routing with time-based shipment consolidation ⋮ Dynamic multi-period vehicle routing with touting ⋮ Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem ⋮ Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems ⋮ Spare parts inventory routing problem with transshipment and substitutions under stochastic demands ⋮ Parameter tuning for local-search-based matheuristic methods ⋮ Inventory routing with pickups and deliveries ⋮ Same-day delivery with pickup stations and autonomous vehicles ⋮ Cross docking for libraries with a depot ⋮ Economic model predictive inventory routing and control ⋮ A maritime scheduling transportation-inventory problem with normally distributed demands and fully loaded/unloaded vessels ⋮ Analysis of effective sets of routes for the split-delivery periodic inventory routing problem ⋮ Waste collection inventory routing with non-stationary stochastic demands ⋮ Replenishment and denomination mix of automated teller machines with dynamic forecast demands

Uses Software

• R
• forecast
• LEMON
• Forecast
• RInside
• expsmooth

Cites Work

• Unnamed Item
• Unnamed Item
• The exact solution of several classes of inventory-routing problems
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• Forecasting with exponential smoothing. The state space approach
• A branch-and-price algorithm for an integrated production and inventory routing problem
• Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation
• Dynamic pickup and delivery problems
• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• The inventory-routing problem with transshipment
• Industrial aspects and literature survey: Combined inventory management and routing
• Optimal solutions in the multi-location inventory system with transshipments
• Inventory control.
• A Hybrid Heuristic for an Inventory Routing Problem
• Computing Near-Optimal Policies in Generalized Joint Replenishment
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems
• Decomposing inventory routing problems with approximate value functions
• Inventory Routing
• Matheuristics
• The Variability of Aggregate Demand with (S, s) Inventory Policies
• Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
• The Stochastic Inventory Routing Problem with Direct Deliveries
• Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
• Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
• Approximate Dynamic Programming
• A Price-Directed Approach to Stochastic Inventory/Routing
• Optimal Inventory Policy

This page was built for publication: Heuristics for dynamic and stochastic inventory-routing