One warehouse multiple retailer systems with vehicle routing costs
Management Science
The vehicle routing problem
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem
Transportation Science
Minimizing the Total Cost in an Integrated Vendor--Managed Inventory System
Journal of Heuristics
Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)
A Price-Directed Approach to Stochastic Inventory/Routing
Operations Research
A Decomposition Approach for the Inventory-Routing Problem
Transportation Science
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem
Transportation Science
Using scenario trees and progressive hedging for stochastic inventory routing problems
Journal of Heuristics
A single supplier-single retailer system with an order-up-to level inventory policy
Operations Research Letters
Robust Inventory Routing Under Demand Uncertainty
Transportation Science
The exact solution of several classes of inventory-routing problems
Computers and Operations Research
Hi-index | 0.00 |
We address a vendor-managed inventory-routing problem where a supplier (vendor) receives a given amount of a single product each period and distributes it to multiple retailers over a finite time horizon using a capacitated vehicle. Each retailer faces external dynamic demand and is controlled by a deterministic order-up-to level policy requiring that the supplier raise the retailer's inventory level to a predetermined maximum in each replenishment. The problem is deciding on when and in what sequence to visit the retailers such that systemwide inventory holding and routing costs are minimized. We propose a branch-and-cut algorithm and a heuristic based on an a priori tour using a strong formulation. To the best of our knowledge, this study is the first to consider a strong formulation for the inventory replenishment part of inventory-routing problems. Computational results reveal that the new branch-and-cut algorithm and heuristic perform better than those noted in the literature.