Generating a rehandling-free intra-block remarshaling plan for an automated container yard

  • Authors:

  • Ri Choe;Taejin Park;Myung-Seob Oh;Jaeho Kang;Kwang Ryel Ryu

  • Affiliations:

  • Department of Computer Engineering, Pusan National University, Busan, Korea 609-735;Department of Computer Engineering, Pusan National University, Busan, Korea 609-735;Department of Computer Engineering, Pusan National University, Busan, Korea 609-735;Department of Computer Engineering, Pusan National University, Busan, Korea 609-735;Department of Computer Engineering, Pusan National University, Busan, Korea 609-735

  • Venue:
  • Journal of Intelligent Manufacturing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Intra-block remarshaling in a container terminal refers to the task of rearranging the export containers, which are usually scattered around within a block, into designated target bays within the same block. Since the containers must be loaded onto a ship following a predetermined order, the rearrangement should be performed in such a way that the containers to be loaded first are placed on top of those to be loaded later in order to avoid rehandling. To minimize the time required to complete a remarshaling task, rehandling should also be avoided during the remarshaling operations. Moreover, when multiple stacking cranes are used for the remarshaling, the interference between cranes should be minimized. This paper presents a method to efficiently search for an intra-block remarshaling plan which is free from rehandling during both the loading operation and remarshaling, and which minimizes the interference between the stacking cranes.