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

DC FieldValueLanguage
dc.contributor.authorBuesing, Christina
dc.contributor.authorKnust, Sigrid
dc.contributor.authorXuan Thanh Le
dc.date.accessioned2021-12-23T16:16:24Z-
dc.date.available2021-12-23T16:16:24Z-
dc.date.issued2018
dc.identifier.issn21924406
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/11855-
dc.description.abstractIntegrating 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.
dc.description.sponsorshipDeutsche Forschungsgemeinschaft (DFG, Germany)German Research Foundation (DFG) [GRK 1916/1]; National Foundation for Science and Technology Development (NAFOSTED, Vietnam)National Foundation for Science & Technology Development (NAFOSTED) [101.01-2017.315]; The authors would like to thank two anonymous referees for their constructive comments. This work was partially supported by the Deutsche Forschungsgemeinschaft (DFG, Germany) under Grant Number GRK 1916/1, and the National Foundation for Science and Technology Development (NAFOSTED, Vietnam) under Grant Number 101.01-2017.315.
dc.language.isoen
dc.publisherSPRINGER HEIDELBERG
dc.relation.ispartofEURO JOURNAL ON COMPUTATIONAL OPTIMIZATION
dc.subjectEXPORT CONTAINERS
dc.subjectInterval uncertainty
dc.subjectOperations Research & Management Science
dc.subjectOPTIMIZATION
dc.subjectRobust optimization
dc.subjectSTACKING CONSTRAINTS
dc.subjectStochastic uncertainty
dc.subjectStorage loading
dc.titleTrade-off between robustness and cost for a storage loading problem: rule-based scenario generation
dc.typejournal article
dc.identifier.doi10.1007/s13675-018-0094-x
dc.identifier.isiISI:000450505300002
dc.description.volume6
dc.description.issue4, SI
dc.description.startpage339
dc.description.endpage365
dc.identifier.eissn21924414
dc.publisher.placeTIERGARTENSTRASSE 17, D-69121 HEIDELBERG, GERMANY
dcterms.isPartOf.abbreviationEURO J. Comput. Optim.
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidKnSi808-
Show simple item record

Google ScholarTM

Check

Altmetric