A routing algorithm for a single transfer crane to load export containers onto a containership

被引:41
作者
Kim, KY [1 ]
Kim, KH [1 ]
机构
[1] Pusan Natl Univ, Dept Ind Engn, Pusan 609735, South Korea
关键词
container terminal; loading; routing;
D O I
10.1016/S0360-8352(97)00219-2
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
It is discussed how to route transfer crane during loading operation of export containers in port container terminal. We determine the number of containers which transfer crane picks up at each yard-bay as well as the sequence of yard-bays which transfer crane visits during the tour. The objective is to minimize the total container handling time of the transfer crane including the set-up time at each yard-bay and the travel time between consecutive yard-bays. This routing problem is formulated as an integer programming. An efficient optimizing algorithm is also developed for the crane routing problem. (C) 1997 Elsevier Science Ltd.
引用
收藏
页码:673 / 676
页数:4
相关论文
共 5 条
  • [1] BAZARAA, 1992, LINEAR PROGRAMMING N, P574
  • [2] CHO, 1982, THESIS OREGON STATE
  • [3] CHUNG SU, 1988, COMPUTERS IND ENG, V14, P113
  • [4] GIFFORD, 1981, THESIS OREGON STATE
  • [5] MARTIN, 1982, THESIS OREGON STATE