Abstract
In this paper, we consider storage loading problems where incoming items have to be assigned to stacks with a limited height. Motivated by practical applications (e.g., container terminals), we assume that the items arrive in a certain sequence at a partly filled storage area and have to be assigned to stacks subject to the constraint that not every item may be stacked on top of every other item. We consider the objectives of minimizing the number of used stacks and the number of badly placed items with respect to retrieval times, respectively. We propose three MIP formulations as well as a variable neighborhood search heuristic and compare them on randomly generated test 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.
