A Cooperative Coevolutionary Algorithm for Optimizing Remarshaling Plan in an Automated Stacking Yard

Park, Kiyeok; Park, Taejin; Ryu, Kwang Ryel

Journal of Navigation and Port Research 2009;33(6):443-450.
Published online August 30, 2009.

자동화 장치장의 재정돈 계획 최적화를 위한 협력적 공진화 알고리즘

박기역, 박태진, 류광렬

A Cooperative Coevolutionary Algorithm for Optimizing Remarshaling Plan in an Automated Stacking Yard

Kiyeok Park, Taejin Park, Kwang Ryel Ryu

Abstract

In this paper, we propose optimizing a remarshaling plan in an automated stacking yard using a cooperative coevolutionary algorithm (CCEA). Remarshaling is the preparation， task of rearranging the containers in such a way that the delay are minimized at the time of loading. A plan for remarshaling can be obtained by the following steps: first determining the target slots to which the individual containers are to be moved and then determining the order of movement of those containers. Where a given problem can be decomposed into some subproblems, CCEA efficiently searches subproblems for a solution In our CCEA, the remarshaling problem is decomposed into two subproblems: one is the subproblem of determining the target slots and the other is that of determining the movement priority. Simulation experiments show that our CCEA derives a plan which is better in the efficiency of both loading and remarshaling compared to other methods which are not based on the idea of problem decomposition.

Key Words: Container Terminal;Automated Stacking Yard;Remarshaling;Optimization; Cooperative Coevolutionary Algorithms