An attribute-decision model for cross-border drayage problem

被引:51
作者
Cheung, Raymond K. [1 ]
Shi, Ning [2 ]
Powell, Warren B. [3 ]
Simao, Hugo P.
机构
[1] Hong Kong Univ Sci & Technol, Dept Ind Engn & Logist Management, Kowloon, Hong Kong, Peoples R China
[2] IBM China Res Lab, Beijing 100094, Peoples R China
[3] Princeton Univ, Dept Operat Res & Financial Engn, Princeton, NJ 08544 USA
关键词
drayage problem; labeling algorithm; composite resource scheduling;
D O I
10.1016/j.tre.2007.07.009
中图分类号
F [经济];
学科分类号
02 ;
摘要
The drayage services between a container terminal and the origin (or destination) of a shipment account for a significant portion of the total transportation cost. They are the key sources of shipment delays, road congestions, and disruptions in the international logistics network. Such a situation is even worse when the drayage services involve cross-border issues. Using Hong Kong, the busiest port in the world, as an example, we illustrate the challenges and issues in managing drayage activities in hub cities. We show that managing cross-border drayage container transportation is a very challenging problem because not only individual resources (e.g., driver, tractor, and chassis) but also the composites of them (e.g., the driver-tractor-chassis triplets) need to be managed simultaneously. The problem is further complicated by the regulatory policies which govern the cross-border activities. We use an attribute-decision model for this problem and implement an adaptive labeling algorithm to solve it. We conduct numerical experiments to evaluate the system performances under various regulatory policies. The results show that the benefit gained by relaxing the regulatory policies is significant. (c) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:217 / 234
页数:18
相关论文
共 17 条
[1]  
Ball M. O., 1983, Decision Sciences, V14, P103, DOI 10.1111/j.1540-5915.1983.tb00172.x
[2]   An ε-relaxation method for separable convex cost network flow problems [J].
Bertsekas, DP ;
Polymenakos, LC ;
Tseng, P .
SIAM JOURNAL ON OPTIMIZATION, 1997, 7 (03) :853-870
[3]   CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].
BODIN, L ;
GOLDEN, B .
NETWORKS, 1981, 11 (02) :97-108
[4]  
Cheung RK, 2003, IIE TRANS, V35, P191, DOI 10.1080/07408170390175431
[5]  
DESROSIERS J, 1995, HDB OPERATIONS RES M
[6]   VEHICLE-ROUTING WITH STOCHASTIC DEMANDS - PROPERTIES AND SOLUTION FRAMEWORKS [J].
DROR, M ;
LAPORTE, G ;
TRUDEAU, P .
TRANSPORTATION SCIENCE, 1989, 23 (03) :166-176
[7]   A simulation approach based on negotiation and cooperation between agents:: A case study [J].
Fischer, K ;
Chaib-draa, B ;
Müller, JP ;
Pischel, M ;
Gerber, C .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 1999, 29 (04) :531-545
[8]  
Fischer M.L., 1995, HDBK OPER R, P1
[9]  
GORODETSKI V, 2003, P MULTIAG SYST APPL, V3, P236
[10]  
*HONG KONG SPEC AD, 2004, STUD HONG KONG PORT