Abstract
Automated container terminals have become popular solutions to the growing need for container handling. We propose a two-stage mathematical model to design an efficient yard template for automated container terminals, using stacks as the allocation unit. In the first stage, a bi-objective model is developed to optimize landside and seaside operations in the terminal. A Benders decomposition algorithm is designed to solve the model. The proposed algorithm is improved by several acceleration strategies, including valid inequalities, pareto-optimal cuts, and ε−optimal approach. Drawing upon the solution derived from the first stage, the second stage assigns containers to specific bays, which is partitioned into multiple subproblems by capitalizing on the structure of it to enhance solvability. Numerous numerical experiments are conducted to verify the efficiency of the proposed algorithm. In addition, scenario analysis demonstrate that the stack-based yard template is more efficient than a cluster-based yard template for automated container terminals with multiple targets.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
