Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation

Autor(en): Buesing, Christina
Knust, Sigrid 
Xuan Thanh Le
Stichwörter: EXPORT CONTAINERS; Interval uncertainty; Operations Research & Management Science; OPTIMIZATION; Robust optimization; STACKING CONSTRAINTS; Stochastic uncertainty; Storage loading
Erscheinungsdatum: 2018
Volumen: 6
Ausgabe: 4, SI
Startseite: 339
Seitenende: 365
Integrating uncertainties into the optimization process is crucial to obtain solutions suitable for practical needs. In particular, the considered uncertainty set has a huge impact on the quality of the computed solutions. In this paper, we consider a storage loading problem in which a set of items must be loaded into a partly filled storage area, regarding stacking constraints and taking into account stochastic data of items arriving later. We propose a robust optimization approach dealing with the stochastic uncertainty. With a focus on constructing the uncertainty set, we offer a rule-based scenario generation approach to derive such a set from the stochastic data. To evaluate the robustness of stacking solutions, we introduce the concept of a security level, which is the probability that a stacking solution is feasible when the data of the uncertain items are realized. Computational results for randomly generated problem instances are presented showing the impact of various factors on the trade-off between robustness and cost of the stacking solutions.
ISSN: 21924406
DOI: 10.1007/s13675-018-0094-x

Show full item record

Google ScholarTM