Dynamic vehicle routing for online B2C delivery

被引:42
作者
Du, TC
Li, EY
Chou, D
机构
[1] Chinese Univ Hong Kong, Dept Decis Sci & Managerial Econ, Hong Kong, Hong Kong, Peoples R China
[2] Yuan Ze Univ, Coll Informat, Dept Informat Management, Chungli 320, Taiwan
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2005年 / 33卷 / 01期
关键词
vehicle routing; transportation; algorithm; route formation; system simulation; electronic commerce; B2C; JIT delivery;
D O I
10.1016/j.omega.2004.03.005
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Electronic commerce (EC) is increasingly popular in today's businesses. The business-to-consumer EC environment has voluminous, unpredictable, and dynamically changing customer orders. A major part of the delivery system of this environment is the dynamic vehicle routing (DVR) system. This study investigates several algorithms suitable for solving the DVR problem in business-to-consumer (B2C) EC environment. It designs the solution process into three phases: initial-routes formation, inter-routes improvement, and intra-route improvement. A computer program is created to demonstrate a system simulating vehicle routing process under the online B2C environment. The simulated system collects data for system performance indexes such as simulation time, travel distance, delivery time, and delay time. The results show that when orders are placed through the Internet in an online B2C environment, the Nearest algorithms can be used to find satisfactory routes during the first phase of a DVR delivery system. The three-phase solution process is proven to be significantly better in travel distance and delivery time than the conventional single-phase solution process. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:33 / 45
页数:13
相关论文
共 39 条
[1]   A genetic algorithm for the vehicle routing problem [J].
Baker, BM ;
Ayechew, MA .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :787-800
[2]   A tabu search algorithm for the vehicle routing problem [J].
Barbarosoglu, G ;
Ozgur, D .
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (03) :255-270
[3]   A simulated annealing algorithm for dynamic layout problem [J].
Baykasoglu, A ;
Gindy, NNZ .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (14) :1403-1426
[4]   WORST-CASE EXAMPLES FOR THE SPACEFILLING CURVE HEURISTIC FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM [J].
BERTSIMAS, D ;
GRIGNI, M .
OPERATIONS RESEARCH LETTERS, 1989, 8 (05) :241-244
[5]   STOCHASTIC AND DYNAMIC VEHICLE-ROUTING IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1993, 41 (01) :60-76
[6]  
BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[7]   CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].
BODIN, L ;
GOLDEN, B .
NETWORKS, 1981, 11 (02) :97-108
[8]   Application of the noising method to the travelling salesman problem [J].
Charon, I ;
Hudry, O .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 125 (02) :266-277
[9]   Simulated annealing metaheuristics for the vehicle routing problem with time windows [J].
Chiang, WC ;
Russell, RA .
ANNALS OF OPERATIONS RESEARCH, 1996, 63 :3-27
[10]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&