An integrated model of the periodic delivery problems for vending-machine supply chains

被引:51
作者
Rusdiansyah, A [1 ]
Tsao, DB [1 ]
机构
[1] Tokyo Inst Technol, Dept Ind Engn & Management, Tokyo 1528552, Japan
关键词
vending-machine supply chains; VMI; IRP; PVRPTW; visit frequency;
D O I
10.1016/j.jfoodeng.2004.05.073
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
In this paper we present a model and solution procedures of the Inventory Routing Problem (IRP) encountered in vending machine supply chains working under vendor-managed inventory (VMI) scheme. The new IRP model is built based on the existing Periodic Vehicle Routing Problem with Time-windows (PVRPTW). The model will be referred to as the Integrated Inventory and Periodic Vehicle Routing Problem with Time-windows (IPVRPTW). The objective of the IPVRPTW is to minimize the sum of the average inventory holding and traveling costs during a given in-day period. The visit frequency is treated as a decision variable instead of as a fixed parameter. We attempt to optimize the visit frequency of each retailer and to build vehicle tours simultaneously in order to find the best trade-off between the inventory holding and traveling costs. Computational experiments are conducted on some instances taken from the literature to evaluate the performance of the proposed model. (c) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:421 / 434
页数:14
相关论文
共 33 条
[1]   ONE WAREHOUSE MULTIPLE RETAILER SYSTEMS WITH VEHICLE-ROUTING COSTS [J].
ANILY, S ;
FEDERGRUEN, A .
MANAGEMENT SCIENCE, 1990, 36 (01) :92-114
[2]  
[Anonymous], TRAVELING SALESMAN P
[3]   A period vehicle routing case study [J].
Baptista, S ;
Oliveira, RC ;
Zúquete, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (02) :220-229
[4]   IMPROVING THE DISTRIBUTION OF INDUSTRIAL GASES WITH AN ONLINE COMPUTERIZED ROUTING AND SCHEDULING OPTIMIZER [J].
BELL, WJ ;
DALBERTO, LM ;
FISHER, ML ;
GREENFIELD, AJ ;
JAIKUMAR, R ;
KEDIA, P ;
MACK, RG ;
PRUTZMAN, PJ .
INTERFACES, 1983, 13 (06) :4-23
[5]  
Beltrami E.L., 1974, Networks, V4, P65, DOI DOI 10.1002/NET3230040106
[6]   A LOCATION BASED HEURISTIC FOR GENERAL ROUTING-PROBLEMS [J].
BRAMEL, J ;
SIMCHILEVI, D .
OPERATIONS RESEARCH, 1995, 43 (04) :649-660
[7]  
Bramel J., 1997, LOGIC LOGISTICS THEO
[8]   A reactive variable neighborhood search for the vehicle-routing problem with time windows [J].
Bräysy, O .
INFORMS JOURNAL ON COMPUTING, 2003, 15 (04) :347-368
[9]  
CAMPBELL A, 2002, VEHICLE ROUTING PROB, P22
[10]   AN IMPROVED HEURISTIC FOR THE PERIOD VEHICLE-ROUTING PROBLEM [J].
CHAO, IM ;
GOLDEN, BL ;
WASIL, E .
NETWORKS, 1995, 26 (01) :25-44