Rescheduling Strategy for Berth Planning in Container Terminals: An Empirical Study from Korea

被引:18
作者
Kim, Armi [1 ]
Park, Hyun-Ji [2 ]
Park, Jin-Hyoung [2 ]
Cho, Sung-Won [2 ]
机构
[1] Hanyang Univ, Dept Transportat & Logist Engn, 55 Hanyangdaehak Ro, Ansan 15588, Gyeonggi Do, South Korea
[2] Korea Res Inst Ships & Ocean Engn, Maritime Safety & Environm Res Div, 32,Yuseong Daero 1312 Beon Gil, Daejeon 34103, South Korea
关键词
container terminals; berth allocation problem; quay crane assignment problem; dynamic rescheduling; mixed-integer linear programming; rolling-horizon approach; empirical study; CRANE ASSIGNMENT; ALLOCATION PROBLEM; SCHEDULING METHOD; MANAGEMENT; OPERATIONS; ALGORITHM; SEARCH; DESIGN; MODELS;
D O I
10.3390/jmse9050527
中图分类号
U6 [水路运输]; P75 [海洋工程];
学科分类号
0814 ; 081505 ; 0824 ; 082401 ;
摘要
The rapid increase in international trade volume has caused frequent fluctuation of the vessels' arrival time in container terminals. In order to solve this problem, this study proposes a methodology for rescheduling berth and quay cranes caused by updated information on the arrival time of vessels. A mixed-integer linear programming model was formulated for the berth allocation and crane assignment problem, and we solved the problem using a rolling-horizon approach. Numerical experiments were conducted under three scenarios with empirical data from a container terminal located in Busan, Korea. The experiments revealed that the proposed model reduces penalty costs and overall delayed departure time compared to the results of the terminal planner.
引用
收藏
页数:15
相关论文
共 43 条
[1]   A Critical Review of Port Pricing Literature : What Role for Academic Research? [J].
Acciaro, Michele .
ASIAN JOURNAL OF SHIPPING AND LOGISTICS, 2013, 29 (02) :207-227
[2]   A follow-up survey of berth allocation and quay crane scheduling problems in container terminals [J].
Bierwirth, Christian ;
Meisel, Frank .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (03) :675-689
[3]   A survey of berth allocation and quay crane scheduling problems in container terminals [J].
Bierwirth, Christian ;
Meisel, Frank .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :615-627
[4]   Storage yard operations in container terminals: Literature overview, trends, and research directions [J].
Carlo, Hector J. ;
Vis, Iris F. A. ;
Roodbergen, Kees Jan .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 235 (02) :412-430
[5]   An integrated method for berth allocation and quay crane assignment to allow for reassignment of vessels to other terminals [J].
Cho, Sung Won ;
Park, Hyun Ji ;
Lee, Chulung .
MARITIME ECONOMICS & LOGISTICS, 2021, 23 (01) :123-153
[6]   The berth allocation problem: models and solution methods [J].
Guan, YP ;
Cheung, RK .
OR SPECTRUM, 2004, 26 (01) :75-92
[7]   A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis [J].
Guan, YP ;
Xiao, WQ ;
Cheung, RK ;
Li, CL .
OPERATIONS RESEARCH LETTERS, 2002, 30 (05) :343-350
[8]   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
[9]   The dynamic berth allocation problem for a container port [J].
Imai, A ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) :401-417
[10]   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