TY - JOUR

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

AU - Anily, Shoshana

AU - Bramel, Julien

N1 - Funding Information:
This research was supported by an internal grant from the Columbia Graduate School of Business and NSF CAREER Award DMI-97-02596.

PY - 2004/12/30

Y1 - 2004/12/30

N2 - 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.

AB - 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.

KW - Asymptotic probabilistic analysis

KW - Bin packing problem

KW - Inventory routing problem

UR - http://www.scopus.com/inward/record.url?scp=4944252412&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2003.09.005

DO - 10.1016/j.dam.2003.09.005

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:4944252412

SN - 0166-218X

VL - 145

SP - 22

EP - 39

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1 SPEC. ISS.

ER -