The allocation of berths and quay cranes by using a sub-gradient optimization technique

被引:80
作者
Zhang, Canrong [1 ,2 ]
Zheng, Li [1 ]
Zhang, Zhihai [1 ]
Shi, Leyuan [2 ]
Armstrong, Aaron J. [2 ]
机构
[1] Tsinghua Univ, Dept Ind Engn, Beijing 100084, Peoples R China
[2] Univ Wisconsin, Dept Ind & Syst Engn, Madison, WI 53706 USA
关键词
Berth allocation; Container terminals; Crane scheduling; Lagrangian relaxation; Sub-gradient; CONTAINER TERMINALS; SCHEDULING METHOD; PORT; ALGORITHM; SEARCH;
D O I
10.1016/j.cie.2009.08.002
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper examines the allocation of berths and quay cranes for vessels arriving at container terminals. Previous work in this area has either ignored or deemphasized the coverage range limitations of quay cranes or imposed too loose or too rigid assumptions about whether quay cranes can be adjusted during loading and discharging, thus making the extracted models less applicable to the actual situation. This paper takes into consideration the coverage ranges of quay cranes and allows for limited adjustments of quay cranes during loading and discharging. A mixed integer programming model is constructed, and a sub-gradient optimization algorithm is applied to solving the problem. Using actual data, the performance of the algorithm is demonstrated. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:40 / 50
页数:11
相关论文
共 26 条
[1]  
CANONACO P, 2007, COMPUTERS OPERATIONS, V35, P2432
[2]  
Chung RK, 2002, TRANSPORT SCI, V36, P79, DOI 10.1287/trsc.36.1.79.568
[3]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[4]  
Geoffrion A., 1974, Approaches to Integer Programming, V2, P82, DOI 10.1007/BFb0120690
[5]   MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1965, 13 (01) :94-&
[6]  
Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223
[7]   Berth allocation in a container port: using a continuous location space approach [J].
Imai, A ;
Sun, X ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (03) :199-221
[8]   The simultaneous berth and quay crane allocation problem [J].
Imai, Akio ;
Chen, Hsieh Chia ;
Nishimura, Etsuko ;
Papadimitriou, Stratos .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (05) :900-920
[9]   Berth allocation at indented berths for mega-containerships [J].
Imai, Akio ;
Nishimura, Etsuko ;
Hattori, Masahiro ;
Papadimitriou, Stratos .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) :579-593
[10]   A crane scheduling method for port container terminals [J].
Kim, KH ;
Park, YM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (03) :752-768