Browse > Article
http://dx.doi.org/10.5394/KINPR.2009.33.6.443

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

Park, Ki-Yeok (Department of Computer Engineering, Pusan National University)
Park, Tae-Jin (Department of Computer Engineering, Pusan National University)
Ryu, Kwang-꾜디 (Department of Computer Science & Engineering, Pusan National University)
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.
Keywords
Container Terminal; Automated Stacking Yard; Remarshaling; Optimization; Cooperative Coevolutionary Algorithms;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 오명섭, 강재호, 류광렬, 김갑환 (2005). "복수 크레인을 활용한 블록 내 컨테이너 이적 계획," 한국항해 항만 학회지 제29권 5호. pp. 447-455   DOI
2 Davis, L. (1985), "Applying adaptive algorithms to epistatic domains," Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pp. 162-164, 1985
3 Wiegand, R. P. and Sarma, J. (2004), "Spatial embedding and loss of gradient in cooperative coevolutioncuy algorithms," Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature, pp.912-922
4 Panait, L., Luke, S., and Harrison, J. F. (2006), "Archivebased cooperative Proceedings of the coevolutioncuy algorithms," Proceedings of the Genetic and Evolutionary Computation Conference, pp. 345-352
5 Kang, J., Oh, M. S., Ahn, E. Y, Ryu, K R., and Kim, K H. (2006), "Planning for intrablock remarshalling in a container terminal," IEN AIE, LNAl 4031, pp. 1211-1220
6 Husbands, P. and Mill, F. (1991), "Simulated coevolution as the mechanism for emergent planning and scheduling," Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 264-270
7 Park, K, Park, T., and Ryu, K R. (2009), "Planning for remarshaling in an automated container terminal using cooperative coevolutioncuy algorithms," ACM Symposium on Applied Computing
8 Kim, K H., and Bae, J. w. (1998), "Remarshaling export containers in port container terminals," Computers and Industrial Engineering, vol. 35, no. 3-4, pp. 655-658   DOI   ScienceOn
9 Wiegand, R. P. (2003), Analysis of cooperative coevolutioncuy algorithms," PhD thesis, Department of Computer Science, George Mason University
10 강재호, 오명섭, 류광렬, 김갑환(2005), "컨테이너 터미널 장치장에서 블록 내 이적을 위한 컨테이너 이동 순서 계확," 한국항해항만학회지, 제29권 1호, pp. 83-90   DOI
11 Lee, Y., and Hsu, N. Y. (2007), "An optimization model for the container premarshalling problem," Computer and Operations Research, vol. 34, pp. 3295-3313   DOI   ScienceOn
12 Zhang, Y., Mi, w., Chang, D., and Yan, W. (2007), "An optimization model for intrabay relocation of outbound container on container yards," International Conference on Automation and Logistics, pp. 776-781
13 Hirashima, Y, Ishikawa, N., and Takeda, K (2006), "A new reinforcement learning for group-based marshaling plan considering desired layout of containers in port terminals," Proc. IEEE Conf. Networking, Sensing and Control, pp. 670-675