An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem

Authors:
Shoshana Anily;Julien Bramel
Affiliations:
Faculty of Management, Tel-Aviv University, Tel-Aviv 69978, Israel;406 Uris Hall, Columbia University, New York, NY
Venue:
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Year:
2004

Citing 6
Cited 3

Martingale inequalities and NP-complete problems

Mathematics of Operations Research
One warehouse multiple retailer systems with vehicle routing costs

Management Science
A class of Euclidean routing problems with general rout cost functions

Mathematics of Operations Research
On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems

Management Science
Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems

Management Science
Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models

Operations Research

Invited Review: Industrial aspects and literature survey: Combined inventory management and routing

Computers and Operations Research
Cost sharing in distribution problems for franchise operations

Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
Coordination of split deliveries in one-warehouse multi-retailer distribution systems

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the Inventory-Routing Problem where n geographically dispersed retailers must be supplied by a central facility. The retailers experience demand for a product at a deterministic rate and incur holding costs for keeping inventory. Distribution is performed by a fleet of capacitated vehicles. The objective is to minimize the average transportation and inventory costs per unit time over the infinite horizon. In this paper, we focus on the set of fixed partition policies. In a fixed partition policy, the retailers are partitioned into disjoint and collectively exhaustive sets. Each set of retailers is served independently of the others and at its optimal replenishment rate. We derive a deterministic (O(n)) lower bound on the cost of the optimal fixed partition policy. A probabilistic analysis of the performance of this bound demonstrates that it is asymptotically 98.5%-effective. That is, as the number of retailers increases, the lower bound is very close to the cost of the optimal fixed partition policy.