UNIVERSITÄTSBIBLIOTHEK
  • search hit 1 of 1
Back to Result List

Robust storage loading problems with stacking and payload constraints

  • We consider storage loading problems where items with uncertain weights have to be loaded into a storage area, taking into account stacking and payload constraints. Following the robust optimization paradigm, we propose strict and adjustable optimization models for finite and interval-based uncertainties. To solve these problems, exact decomposition and heuristic solution algorithms are developed. For strict robustness, we also present a compact formulation based on a characterization of worst-case scenarios. Computational results show that computation times and algorithm gaps are reasonable for practical applications. Furthermore, we find that the robustness concepts show different potential depending on the type of data being used.

Download full text files

Export metadata

Metadaten
Author:Marc Goerigk, Sigrid Knust, Xuan Thanh Le
URN (permanent link):urn:nbn:de:hbz:386-kluedo-41589
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (158)
Document Type:Preprint
Language of publication:English
Publication Date:2015/08/17
Year of Publication:2015
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2015/08/18
Number of page:30
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vom 30.07.2015