A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching

DOI10.1287/opre.41.1.77zbMath0771.90038OpenAlexW1991247533MaRDI QIDQ5288141

Alan S. Minkoff

Publication date: 9 August 1993

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.41.1.77

zbMATH Keywords

heuristicdelivery dispatchingstochastic vehicle dispatching

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Markov and semi-Markov decision processes (90C40)

Related Items (13)

A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows ⋮ A multi-period TSP with stochastic regular and urgent demands ⋮ An optimization algorithm for the inventory routing problem with continuous moves ⋮ Inventory Routing ⋮ The inventory-routing problem with transshipment ⋮ Industrial aspects and literature survey: Combined inventory management and routing ⋮ Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models ⋮ Decomposing inventory routing problems with approximate value functions ⋮ Bayesian Exploration for Approximate Dynamic Programming ⋮ An effective integrated inventory model to coordinate inventory replenishment and shipment consolidation ⋮ A neural network approach to the vessel dispatching problem ⋮ Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs ⋮ Integrated inventory replenishment and temporal shipment consolidation: a comparison of quantity-based and time-based models

This page was built for publication: A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching