Abstract
Abstract In this paper, we are interested in finding efficient practical approaches to solve the Container Stacking Problem in Maritime Ports. Given container arrivals in a container port terminal, the objective is to assign a slot to each one in a storage area at least cost with respect to pre-defined constraints. The cost is expressed in term of number of expected relocation movements. The constraints to respect are stack height, stack number, and departure dates. We propose to improve a previous heuristic model proposed by Mark B. Duinkerken and Ottjes (2001) based on the computation of an indactor called the “remaining stack capacity“.
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.
