Heuristics for dynamic and stochastic inventory-routing
From MaRDI portal
Publication:337178
DOI10.1016/J.COR.2014.07.001zbMATH Open1348.90024OpenAlexW2039638040MaRDI QIDQ337178FDOQ337178
Leandro C. Coelho, Jean-François Cordeau, G. 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
Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Forecasting with exponential smoothing. The state space approach
- Optimal Inventory Policy
- The inventory-routing problem with transshipment
- Matheuristics
- Approximate Dynamic Programming
- Decomposing inventory routing problems with approximate value functions
- Dynamic pickup and delivery problems
- Industrial aspects and literature survey: Combined inventory management and routing
- Dynamic programming and optimal control. Vol. 2
- The exact solution of several classes of inventory-routing problems
- Inventory Routing
- The Stochastic Inventory Routing Problem with Direct Deliveries
- A Price-Directed Approach to Stochastic Inventory/Routing
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Inventory control.
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- A hybrid heuristic for an inventory routing problem
- The Variability of Aggregate Demand with (S, s) Inventory Policies
- Deterministic Order-Up-To Level Policies in an 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
- Optimal solutions in the multi-location inventory system with transshipments
- Computing near-optimal policies in generalized joint replenishment
- Scenario tree-based heuristics for stochastic inventory-routing problems
- Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
- Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- A branch-and-price algorithm for an integrated production and inventory routing problem
Cited In (30)
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- Title not available (Why is that?)
- A mathematical programming-based heuristic for the production routing problem with transshipments
- Title not available (Why is that?)
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- Same-day delivery with pickup stations and autonomous vehicles
- Replenishment and denomination mix of automated teller machines with dynamic forecast demands
- Waste collection inventory routing with non-stationary stochastic demands
- Probabilistic analyses and practical algorithms for inventory-routing models
- Benders Decomposition for Production Routing Under Demand Uncertainty
- Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands
- Inventory routing with pickups and deliveries
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
- On the effect of using sensors and dynamic forecasts in inventory-routing problems
- Cross docking for libraries with a depot
- 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
- A variable neighborhood search for the multi-period collection of recyclable materials
- Economic model predictive inventory routing and control
- A hybrid heuristic for a stochastic production-inventory-routing problem
- Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem
- Spare parts inventory routing problem with transshipment and substitutions under stochastic demands
- A maritime scheduling transportation-inventory problem with normally distributed demands and fully loaded/unloaded vessels
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
- Stochastic inventory routing with time-based shipment consolidation
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
- Dynamic multi-period vehicle routing with touting
- The two-echelon multi-depot inventory-routing problem
- Long‐term effects of short planning horizons for inventory routing problems
- Parameter tuning for local-search-based matheuristic methods
Uses Software
This page was built for publication: Heuristics for dynamic and stochastic inventory-routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337178)
