Home > Research > Publications & Outputs > Robust storage loading problems with stacking a...

Research

Associated organisational unit

Electronic data

  • Author version

    Rights statement: 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

    Accepted author manuscript, 421 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

Robust storage loading problems with stacking and payload constraints

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published
Close
More...
<mark>Journal publication date</mark>16/08/2016
<mark>Journal</mark>European Journal of Operational Research
Issue number1
Volume253
Number of pages17
Pages (from-to)51-67
Publication StatusPublished
Early online date17/02/16
<mark>Original language</mark>English

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.

Bibliographic note

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