Solution approaches for storage loading problems with stacking constraints

Autor(en): Oelschlaegel, Tobias
Knust, Sigrid 
Stichwörter: Computer Science; Computer Science, Interdisciplinary Applications; CONTAINER TERMINALS; Engineering; Engineering, Industrial; EXPORT CONTAINERS; Heuristic; Loading; Logistics; OPERATIONS; Operations Research & Management Science; RULES; Stacking constraints; Stacks; Storage
Erscheinungsdatum: 2021
Herausgeber: PERGAMON-ELSEVIER SCIENCE LTD
Journal: COMPUTERS & OPERATIONS RESEARCH
Volumen: 127
Zusammenfassung: 
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. (C) 2020 Elsevier Ltd. All rights reserved.
ISSN: 03050548
DOI: 10.1016/j.cor.2020.105142

Show full item record

Google ScholarTM

Check

Altmetric