Analysis of practical policies for a single link distribution system

被引:9
作者
Bertazzi, Luca [1 ]
Chan, Lap Mui Ann
Speranza, Maria Grazia
机构
[1] Univ Brescia, Dept Quantitat Methods, I-25121 Brescia, Italy
[2] Virginia Tech, Grado Dept Ind & Syst Engn, Blacksburg, VA 24061 USA
关键词
inventory; transportation; worst-case analysis; practical policies;
D O I
10.1002/nav.20221
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency-based periodic shipping (FBPS) policies. We show that, in the worst-case, the Best ZIO policy has a performance ratio of root 2. A better performance guarantee of 16 root 3045/255 - 37/17 approximate to 1.286 is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a 4 performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. (c) 2007 Wiley Periodicals, Inc.
引用
收藏
页码:497 / 509
页数:13
相关论文
共 14 条
[1]   ONE WAREHOUSE MULTIPLE RETAILER SYSTEMS WITH VEHICLE-ROUTING COSTS [J].
ANILY, S ;
FEDERGRUEN, A .
MANAGEMENT SCIENCE, 1990, 36 (01) :92-114
[2]   Continuous and discrete shipping strategies for the single link problem [J].
Bertazzi, L ;
Speranza, MG .
TRANSPORTATION SCIENCE, 2002, 36 (03) :314-325
[3]   Rounding procedures for the discrete version of the capacitated economic order quantity problem [J].
Bertazzi, L ;
Speranza, MG .
ANNALS OF OPERATIONS RESEARCH, 2001, 107 (1-4) :33-49
[4]   ANALYZING TRADE-OFFS BETWEEN TRANSPORTATION, INVENTORY AND PRODUCTION COSTS ON FREIGHT NETWORKS [J].
BLUMENFELD, DE ;
BURNS, LD ;
DILTZ, JD ;
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1985, 19 (05) :361-380
[5]   DISTRIBUTION STRATEGIES THAT MINIMIZE TRANSPORTATION AND INVENTORY COSTS [J].
BURNS, LD ;
HALL, RW ;
BLUMENFELD, DE ;
DAGANZO, CF .
OPERATIONS RESEARCH, 1985, 33 (03) :469-490
[6]   Probabilistic analyses and practical algorithms for inventory-routing models [J].
Chan, LMA ;
Federgruen, A ;
Simchi-Levi, D .
OPERATIONS RESEARCH, 1998, 46 (01) :96-106
[7]   DETERMINING VEHICLE DISPATCH FREQUENCY WHEN SHIPPING FREQUENCY DIFFERS AMONG SUPPLIERS [J].
HALL, RW .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1985, 19 (05) :421-431
[9]   DETERMINING OPTIMAL REORDER INTERVALS IN CAPACITATED PRODUCTION-DISTRIBUTION SYSTEMS [J].
JACKSON, PL ;
MAXWELL, WL ;
MUCKSTADT, JA .
MANAGEMENT SCIENCE, 1988, 34 (08) :938-958
[10]   ESTABLISHING CONSISTENT AND REALISTIC REORDER INTERVALS IN PRODUCTION-DISTRIBUTION SYSTEMS [J].
MAXWELL, WL ;
MUCKSTADT, JA .
OPERATIONS RESEARCH, 1985, 33 (06) :1316-1341