Re-marshaling export containers in port container terminals

被引:84
作者
Kim, KK [1 ]
Bae, JW [1 ]
机构
[1] Pusan Natl Univ, Dept Ind Engn, Res Inst Mech Technol, Pusan 609735, South Korea
关键词
Re-marshaling; container port terminal; export containers; traveling salesman problem; dynamic programming;
D O I
10.1016/S0360-8352(98)00182-X
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In order to speed up the loading operation of export containers onto a ship, the re-marshaling operation is an usual practice in port container terminals. It is assumed that the current yard map for containers is available and a desirable bay layout is provided. A methodology is proposed to convert the current bay layout into the desirable layout by moving the fewest possible number of containers and in the shortest possible travel distance. The problem is decomposed into three sub-problems such as the bay matching, the move planning, and the task sequencing. The bay matching is to match a specific current bay with a bay configuration in-the target layout. In the move planning stage, the number of containers to be moved from a specific bay to another is determined. The completion time of the re-marshaling operation is minimized by sequencing the moving tasks in the final stage. A mathematical model is suggested for each sub-problem. A numerical example is provided to illustrate the solution procedure. (C) 1998 Elsevier science Ltd. All rights reserved.
引用
收藏
页码:655 / 658
页数:4
相关论文
共 6 条