Determining Containership Loading Problem on the Basis of an Adopted Number of Handling Cranes

Abstract

Fhster turnaround time of vessels is one of paramount factors in a corrtainer terminal for assuring competitiye advaRtage in the shipping industy which can be achieved by ethcient handling process of vessels, especially the associated loading plan in the loading sequence. This paper deals with the ship loading problem regarding to the number of cranes to be llsed in a loading process while keeping reasonable ship stability. In order to preserve the ship stability, some heavier containers may be stowed at the bottom of ship holds. When those containers are stacked below others on a yard container block which are wkhdrawn later, it may required a number of rehandles when they are renieved ffom the blocks. The ethcient of Ioading process is evaluated by the minimum number of container rehandles required. [[b solve this problem, a mix integer programming is formulated. The genetic algorithm, which is widely applied for a plenty Df practical mathematical prograrnming, is employed as a heuristic for the nearly optimized solutions and a wide variety of numerical experiments was made where solutions by this problem are useful an d applicable in practice. Kleyworzis: Containership handiing; Container rehandles; GeneticAlgorithm,' Logistics