Planning for Selective Remarshaling in an Automated Container Terminal Using Coevolutionary Algorithms

Authors

  • Kiyeok Park Pusan National University
  • Taejin Park Pusan National University
  • Kwang Ryel Ryu Pusan National University

DOI:

https://doi.org/10.23055/ijietap.2013.20.1-2.508

Abstract

Remarshaling in a container terminal refers to the task of rearranging containers stored in the stacking yard to improve the efficiency of subsequent loading onto a vessel. When the time allowed for such preparatory work is limited, only a selected subset of containers can be rearranged. This paper proposes a cooperative co-evolutionary algorithm (CCEA) which decomposes the planning problem into three subproblems of selecting containers, determining target locations, and finding a moving order, and conducts a cooperative parallel search to find a good solution for each subproblem. To cope with the uncertainty of crane operation in real terminals, the proposed method iteratively replans at regular intervals to minimize the gap between the plan and the execution. For an efficient search under real-time constraint of iterative replanning, our CCEA reuses the final populations of the previous iteration instead of restarting from scratch.

Author Biographies

Kiyeok Park, Pusan National University

Department of Computer Engineering

Taejin Park, Pusan National University

Department of Computer Engineering

Kwang Ryel Ryu, Pusan National University

Department of Computer Engineering

Professor

Published

2013-04-08

How to Cite

Park, K., Park, T., & Ryu, K. R. (2013). Planning for Selective Remarshaling in an Automated Container Terminal Using Coevolutionary Algorithms. International Journal of Industrial Engineering: Theory, Applications and Practice, 20(1-2). https://doi.org/10.23055/ijietap.2013.20.1-2.508

Issue

Section

Logistics and Material Handling