Abstract
The blocks relocation problem aims to minimise the number of unproductive relocation moves where blocking containers have to be removed to other stacks when retrieving containers in a given sequence from a container yard. Sometimes there is not enough time to solve this complex optimisation problem and information on the crane performance, which mainly depends on the relocation effort, is required under great time pressure. In this case, simple measures are required, which are quickly computed and, nonetheless, accurately predict the amount of relocation moves. This paper is dedicated to comparing twelve different known and new measures. Our computational study shows that composite measures combining a lower bound argument with a simple rule-based upper bound lead to predictions of remarkable accuracy.
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.
