Planning for remarshaling in an automated container terminal using cooperative coevolutionary algorithms

ABSTRACT

The productivity of a container terminal is highly dependent on the efficiency of loading the containers onto the vessels. The efficiency of container loading depends on how the containers are stacked in the storage yard. Remarshaling refers to the preparatory task of rearranging the containers to maximize the efficiency of loading. In this paper, we propose cooperative coevolutionary algorithms (CCEAs) to derive a plan for remarshaling in an automated container terminal. CCEAs efficiently search for a solution in a reduced search space by decomposing a problem into subproblems. Our CCEA decomposes the problem into two subproblems: one for determining where to move the containers and the other for determining the movement priority. Simulation experiments show that our CCEA can derive a better plan in terms of the efficiency of both loading and remarshaling than other methods which are not based on the notion of problem decomposition.

REFERENCES

• 1: Davis, L., Applying adaptive algorithms to epistatic do-mains, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, 1985, pp. 162--164.
• 2: Hirashima, Y., Ishikawa, N., and Takeda, K., A new reinforcement learning for group-based marshaling plan considering desired layout of containers in port terminals, Proc. IEEE Conf. Networking, Sensing and Control, April 2006, pp. 670--675.
• 3: Husbands, P., and Mill, F., Simulated coevolution as the mechanism for emergent planning and scheduling, Proceedings of the Fourth International Conference on Genetic Algorithms, 1991, pp. 264--270.
• 4: Kang, J., Oh, M. S., Ahn, E. Y., Ryu, K. R., and Kim, K. H., Planning for intra-block remarshalling in a container terminal, IEA/AIE, LNAI 4031, 2006, pp. 1211--1220.
• 5: Kang, J., Ryu, K. R., and Kim, K. H., Determination of Storage Location for Incoming Containers of Uncertain Weight, IEA/AIE, LNAI 4031, 2006, pp. 1159--1168.
• 6: Kap Hwan Kim , Jong Wook Bae, Re-marshaling export containers in port container terminals, Computers and Industrial Engineering, v.35 n.3-4, p.655-658, Dec 1998
• 7: Kirkpatric, S., Gelatt, C. D., and Vecchi, M. P., Optimization by simulated annealing, Science, 220, 1983, pp. 671--680.
• 8: Yusin Lee , Nai-Yun Hsu, An optimization model for the container pre-marshalling problem, Computers and Operations Research, v.34 n.11, p.3295-3313, November, 2007 [doi>10.1016/j.cor.2005.12.006]
• 9: Liviu Panait , Sean Luke , Joseph F. Harrison, Archive-based cooperative coevolutionary algorithms, Proceedings of the 8th annual conference on Genetic and evolutionary computation, July 08-12, 2006, Seattle, Washington, USA [doi>10.1145/1143997.1144060]
• 10: Rudolf Paul Wiegand , Kenneth A. Jong, An analysis of cooperative coevolutionary algorithms, George Mason University, Fairfax, VA, 2004
• 11: Wiegand, R. P., and Sarma, J., Spatial embedding and loss of gradient in cooperative coevolutionary algorithms, Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature, 2004, pp. 912--922.
• 12: Zhang, Y., Mi, W., Chang, D., and Yan, W., An Optimization Model for Intra-bay Relocation of Outbound Container on Container Yards, International Conference on Automation and Logistics, 2007, pp. 776--781.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search

General Terms:
Algorithms

Keywords:
container terminal, cooperative coevolutionary algorithms, remarshaling