Abstract.
A beam search algorithm was applied to solve the load-sequencing problem in port container terminals. The algorithm was used to maximize the operational efficiency of transfer cranes and quay cranes (QCs) while satisfying various constraints on stacking containers onto vessels. The load-sequencing problem consisted of two decision-making subproblems. In the first subproblem, a pickup schedule was constructed in which the travel route of a transfer crane (TC) as well as the number of containers it must pick up at each yard-bay are determined. In the second subproblem, the load sequence for individual containers was determined. This study suggested a search scheme in which an algorithm to solve the second subproblem is imbedded into the algorithm for the first subproblem. Numerical experiments using practical data were performed to test the performance of the developed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Correspondence to: Kap Hwan Kim
This study was supported in part by the Korea Science and Engineering Foundation through the Center for Intelligent and Integrated Port Management Systems (CIIPMS) at Dong-A University. Authors also appreciate Director In-Tae Baek in Korea Logistics Network Co. for his help during the data collection.
Rights and permissions
About this article
Cite this article
Kim, K.H., Kang, J.S. & Ryu, K.R. A beam search algorithm for the load sequencing of outbound containers in port container terminals. OR Spectrum 26, 93–116 (2004). https://doi.org/10.1007/s00291-003-0148-0
Issue Date:
DOI: https://doi.org/10.1007/s00291-003-0148-0