Dynamic crane deployment in container storage yards

被引:178
作者
Zhang, CQ
Wan, YW
Liu, JY [1 ]
Linn, RJ
机构
[1] Hong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong, Peoples R China
[2] Florida Int Univ, Dept Ind & Syst Engn, Miami, FL USA
关键词
container terminal; crane deployment; mixed integer programming; Lagrangean relaxation;
D O I
10.1016/S0191-2615(01)00017-0
中图分类号
F [经济];
学科分类号
02 ;
摘要
Storage yards at container terminals serve as temporary buffers for inbound and outbound containers. Rubber tyred gantry cranes (RTGCs) are the most frequently used equipment in yards for container handling. The efficiency of yard operations heavily depends on the productivity of these RTGCs. As the workload distribution in the yard changes over time, dynamic deployment of RTGCs among storage blocks (container stacking areas) is an important issue of terminal operations management. This paper addresses the crane deployment problem. Given the forecasted workload of each block in each period of a day, the objective is to find the times and routes of crane movements among blocks so that the total delayed workload in the yard is minimized. The problem is formulated as a mixed integer programming (MIP) model and solved by Lagrangean relaxation. To improve the performance of this approach, we augment the Lagrangean relaxation model by adding additional constraints and modify the solution procedure accordingly. Computational experiments show that the modified Lagrangean relaxation method generates excellent solutions in short time. (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:537 / 555
页数:19
相关论文
共 29 条
[1]   A container terminal simulation model with animation capabilities [J].
Ballis, A ;
Abacoumkin, C .
JOURNAL OF ADVANCED TRANSPORTATION, 1996, 30 (01) :37-57
[2]   Cole-Hopf quotient and exact solutions of the generalized Fitzhugh-Nagumo equations [J].
Chen, DY ;
Gu, Y .
ACTA MATHEMATICA SCIENTIA, 1999, 19 (01) :7-14
[3]   THE CRANE SCHEDULING PROBLEM [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1989, 23 (03) :159-175
[4]  
Daganzo CF, 1990, TRANSPORT RES REC, P1
[5]   HANDLING STRATEGIES FOR IMPORT CONTAINERS AT MARINE TERMINALS [J].
DECASTILHO, B ;
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1993, 27 (02) :151-166
[6]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[7]  
GEOFFRION AM, 1974, MATH PROGRAMMING STU, V82, P114
[8]  
Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223
[9]   Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound [J].
Holmberg, K ;
Hellstrand, J .
OPERATIONS RESEARCH, 1998, 46 (02) :247-259
[10]   Efficient planning of berth allocation for container terminals in Asia [J].
Imai, A ;
Nagaiwa, K ;
Tat, CW .
JOURNAL OF ADVANCED TRANSPORTATION, 1997, 31 (01) :75-94