Robust storage loading problems with stacking and payload constraints

Goerigk, Marc and Knust, Sigrid and Le, Xuan Thanh (2016) Robust storage loading problems with stacking and payload constraints. European Journal of Operational Research, 253 (1). pp. 51-67. ISSN 0377-2217

[img]
Preview
PDF (Author version)
paper_bw.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (431kB)

Abstract

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 propose a compact formulation based on a characterization of worst-case scenarios. Computational results for randomly generated data with up to 300 items are presented showing that the robustness concepts have different potential depending on the type of data being used.

Item Type:
Journal Article
Journal or Publication Title:
European Journal of Operational Research
Additional Information:
This is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, 253, 1, 2016 DOI: 10.1016/j.ejor.2016.02.019
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1800/1802
Subjects:
ID Code:
78312
Deposited By:
Deposited On:
19 Feb 2016 09:32
Refereed?:
Yes
Published?:
Published
Last Modified:
05 Apr 2020 03:49