Lot-size models with back-logging: strong reformulations and cutting planes
Mathematical Programming: Series A and B
One warehouse multiple retailer systems with vehicle routing costs
Management Science
Robust Solutions to Least-Squares Problems with Uncertain Data
SIAM Journal on Matrix Analysis and Applications
Mathematics of Operations Research
The vehicle routing problem
Robust Solutions to Uncertain Semidefinite Programs
SIAM Journal on Optimization
Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
Operations Research
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
Transportation Science
The Stochastic Inventory Routing Problem with Direct Deliveries
Transportation Science
Operations Research
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem
Transportation Science
Adjustable robust solutions of uncertain linear programs
Mathematical Programming: Series A and B
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach
Manufacturing & Service Operations Management
A Price-Directed Approach to Stochastic Inventory/Routing
Operations Research
A Robust Optimization Approach to Inventory Theory
Operations Research
A Decomposition Approach for the Inventory-Routing Problem
Transportation Science
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem
Transportation Science
Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems
INFORMS Journal on Computing
Heuristic approaches for the inventory-routing problem with backlogging
Computers and Industrial Engineering
Using scenario trees and progressive hedging for stochastic inventory routing problems
Journal of Heuristics
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
Robust Approximation to Multiperiod Inventory Management
Operations Research
Computing robust basestock levels
Discrete Optimization
Robust solutions of uncertain linear programs
Operations Research Letters
Hi-index | 0.00 |
This paper introduces a robust inventory routing problem where a supplier distributes a single product to multiple customers facing dynamic uncertain demands over a finite discrete time horizon. The probability distribution of the uncertain demand at each customer is not fully specified. The only available information is that these demands are independent and symmetric random variables that can take some value from their support interval. The supplier is responsible for the inventory management of its customers, has sufficient inventory to replenish the customers, and distributes the product using a capacitated vehicle. Backlogging of the demand at customers is allowed. The problem is to determine the delivery quantities as well as the times and routes to the customers, while ensuring feasibility regardless of the realized demands, and minimizing the total cost composed of transportation, inventory holding, and shortage costs. Using a robust optimization approach, we propose two robust mixed integer programming (MIP) formulations for the problem. We also propose a new MIP formulation for the deterministic (nominal) case of the problem. We implement these formulations within a branch-and-cut algorithm and report results on a set of instances adapted from the literature.