On the nucleolus of the basic vehicle routing game
Mathematical Programming: Series A and B
An Analysis of Bid-Price Controls for Network Revenue Management
Management Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Neuro-Dynamic Programming
Price-Directed Control of Remnant Inventory Systems
Operations Research
Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem
Transportation Science
Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming
Transportation Science
The Stochastic Inventory Routing Problem with Direct Deliveries
Transportation Science
Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing
Manufacturing & Service Operations Management
The Linear Programming Approach to Approximate Dynamic Programming
Operations Research
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem
Transportation Science
A simulation framework for real-time management and control of inventory routing decisions
Proceedings of the 38th conference on Winter simulation
Mathematics of Operations Research
Performance Measurement for Inventory Routing
Transportation Science
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching
Transportation Science
An optimization algorithm for the inventory routing problem with continuous moves
Computers and Operations Research
Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems
INFORMS Journal on Computing
Using scenario trees and progressive hedging for stochastic inventory routing problems
Journal of Heuristics
An improved model for large scale inventory routing problem with useful properties
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
Approximate Dynamic Programming for Ambulance Redeployment
INFORMS Journal on Computing
Coordination of split deliveries in one-warehouse multi-retailer distribution systems
Computers and Industrial Engineering
Robust Approximate Bilinear Programming for Value Function Approximation
The Journal of Machine Learning Research
Robust Inventory Routing Under Demand Uncertainty
Transportation Science
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
We consider a new approach to stochastic inventory/routing that approximates the future costs of current actions using optimal dual prices of a linear program. We obtain two such linear programs by formulating the control problem as a Markov decision process and then replacing the optimal value function with the sum of single-customer inventory value functions. The resulting approximation yields statewise lower bounds on optimal infinite-horizon discounted costs. We present a linear program that takes into account inventory dynamics and economics in allocating transportation costs for stochastic inventory routing. On test instances we find that these allocations do not introduce any error in the value function approximations relative to the best approximations that can be achieved without them. Also, unlike other approaches, we do not restrict the set of allowable vehicle itineraries in any way. Instead, we develop an efficient algorithm to both generate and eliminate itineraries during solution of the linear programs and control policy. In simulation experiments, the price-directed policy outperforms other policies from the literature.