Abstract
The Container Relocation Problem for multiple bays consists of finding the minimum number of moves to load a set of stacked containers on a ship according to a given loading sequence, and in minimizing the crane’s working time for an entire yard of multiple bays. This is a crucial problem for every commercial port in the world given the maximum time requirements and the costs associated with the containers’ retrieval. In this paper, we propose a Greedy Randomized Adaptive Search Procedure to solve this problem. We use a myopic function specially designed to produce feasible candidate solutions with a structure that allows a local search procedure to optimize relocations. In order to validate our approach, we use a large set of well-known Container Relocation Problems for multiples bays, as well as a statistical analysis of our results. Our experiments show new bounds for various instances.
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.
