Modelling emergency lateral transshipments in inventory systems
Management Science
A two-echelon inventory system with priority shipments
Management Science
A note on bounds for direct shipping cost
Management Science
Rejoinder to “A note on bounds for direct shipping costs”
Management Science
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
Transportation Science
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
Transportation Science
The Stochastic Inventory Routing Problem with Direct Deliveries
Transportation Science
Continuous and Discrete Shipping Strategies for the Single Link Problem
Transportation Science
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem
Transportation Science
Retailer- vs. Vendor-Managed Inventory and Brand Competition
Management Science
Journal of Global Optimization
A general heuristic for vehicle routing problems
Computers and Operations Research
A comparison of five heuristics for the multiple depot vehicle scheduling problem
Journal of Scheduling
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem
Transportation Science
Fifty Years of Vehicle Routing
Transportation Science
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
INFORMS Journal on Computing
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
Operations Research Letters
The exact solution of several classes of inventory-routing problems
Computers and Operations Research
The synchronized arc and node routing problem: Application to road marking
Computers and Operations Research
Headquarter-centered common sourcing management through order coordination and consolidation
Computers and Operations Research
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
This paper introduces the Inventory-Routing Problem with Transshipment (IRPT). This problem arises when vehicle routing and inventory decisions must be made simultaneously, which is typically the case in vendor-managed inventory systems. Heuristics and exact algorithms have already been proposed for the Inventory-Routing Problem (IRP), but these algorithms ignore the possibility of performing transshipments between customers so as to further reduce the overall cost. We present a formulation that allows transshipments, either from the supplier to customers or between customers. We also propose an adaptive large neighborhood search heuristic to solve the problem. This heuristic manipulates vehicle routes while the remaining problem of determining delivery quantities and transshipment moves is solved through a network flow algorithm. Our approach can solve four different variants of the problem: the IRP and the IRPT, under maximum level and order-up-to level policies. We perform an extensive assessment of the performance of our heuristic.