Truck dock assignment problem with operational time constraint within crossdocks

被引:119
作者
Miao, Zhaowei [2 ]
Lim, Andrew [1 ]
Ma, Hong [1 ]
机构
[1] Hong Kong Univ Sci & Technol, Dept IELM, Kowloon, Hong Kong, Peoples R China
[2] Xiamen Univ, Sch Management, Dept Management Sci, Xiamen, Fujian, Peoples R China
关键词
Heuristics; Crossdocks; Dock assignment; TRANSSHIPMENT; WINDOWS;
D O I
10.1016/j.ejor.2007.09.031
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we consider a truck dock assignment problem with an operational time constraint in crossdocks where the number of trucks exceeds the number of docks available. The problem feasibility is affected by three factors: the arrival and departure time window of each truck, the operational time for cargo shipment among the docks, and the total capacity available to the crossdock. The objective is to find an optimal assignment of trucks that minimizes the operational cost of the cargo shipments and the total number of unfulfilled shipments at the same time. We combine the above two objectives into one term: the total cost, a sum of the total dock operational cost and the penalty cost for all the unfulfilled shipments. The problem is then formulated as an integer programming (IP) model. We find that as the problem size grows, the IP model size quickly expands to an extent that the ILOG CPLEX Solver can hardly manage. Therefore, two meta-heuristic approaches, Tabu Search (TS) and genetic algorithm (GA), are proposed. Computational experiments are conducted, showing that meta-heuristics, especially the Tabu search, dominate the CPLEX Solver in nearly all test cases adapted from industrial applications. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:105 / 115
页数:11
相关论文
共 16 条
[1]  
Aronson J. E., 1989, Annals of Operations Research, V20, P1, DOI 10.1007/BF02216922
[2]   AIRCRAFT STAND ASSIGNMENT TO MINIMIZE WALKING [J].
BABIC, O ;
TEODOROVIC, D ;
TOSIC, V .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1984, 110 (01) :55-66
[3]   Reducing labor costs in an LTL crossdocking terminal [J].
Bartholdi, JJ ;
Gue, KR .
OPERATIONS RESEARCH, 2000, 48 (06) :823-832
[4]   The over-constrained airport gate assignment problem [J].
Ding, H ;
Lim, A ;
Rodrigues, B ;
Zhu, Y .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (07) :1867-1880
[5]   New heuristics for over-constrained flight to gate assignments [J].
Ding, H ;
Lim, A ;
Rodrigues, B ;
Zhu, Y .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (07) :760-768
[6]  
Glover F., 1998, Handbook of combinatorial optimization
[7]  
Goldberg Jr D.E., 1985, P 1 INT C GEN ALG TH, V154, P154
[8]  
HOLLAND J, 1975, ADAPTATION NATURAL A
[9]   The quickest transshipment problem [J].
Hoppe, B ;
Tardos, E .
MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (01) :36-62
[10]   Transshipment through crossdocks with inventory and time windows [J].
Lim, A ;
Miao, ZW ;
Rodrigues, B ;
Xu, Z .
NAVAL RESEARCH LOGISTICS, 2005, 52 (08) :724-733