共 43 条
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
相关论文