MIP-based approaches for robust storage loading problems with stacking constraints

Autor(en): Le, Xuan Thanh
Knust, Sigrid 
Stichwörter: Adjustable robustness; Computer Science; Computer Science, Interdisciplinary Applications; Engineering; Engineering, Industrial; EXPORT CONTAINERS; Mixed integer linear programming; Operations Research & Management Science; OPTIMIZATION; Stacking constraints; Storage loading; Strict robustness
Erscheinungsdatum: 2017
Volumen: 78
Startseite: 138
Seitenende: 153
In this paper, we consider storage loading problems under uncertainty where the storage area is organized in fixed stacks with a limited height. Such problems appear in several practical applications, e.g., when loading container terminals, container ships or warehouses. Incoming items arriving at a partly filled storage area have to be assigned to stacks under the restriction that not every item may be stacked on top of every other item and taking into account that some items with uncertain data will arrive later. Following the robust optimization paradigm, we propose different MIP formulations for the strictly and adjustable robust counterparts of the uncertain problem. Furthermore, we show that in the case of interval uncertainties the computational effort to find adjustable robust solutions can be reduced. Computational results are presented for randomly generated instances with up to 480 items. The results show that instances of this size can be solved in reasonable time and that including robustness improves solutions where uncertainty is not taken into account. (C) 2016 Elsevier Ltd. All rights reserved.
ISSN: 03050548
DOI: 10.1016/j.cor.2016.08.016

Show full item record

Page view(s)

Last Week
Last month
checked on Mar 4, 2024

Google ScholarTM