.png){kind=icon}
.png){kind=icon}
Return
Robust storage loading problems with stacking and payload constraints
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2016.02.019.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
OR in maritime industry
Storage loading
Stacking problems
Payload restrictions
Robust optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W