Robust optimization for premarshalling with uncertain priority classes

DC FieldValueLanguage
dc.contributor.authorBoge, Sven
dc.contributor.authorGoerigk, Marc
dc.contributor.authorKnust, Sigrid
dc.date.accessioned2021-12-23T16:10:46Z-
dc.date.available2021-12-23T16:10:46Z-
dc.date.issued2020
dc.identifier.issn03772217
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/9386-
dc.description.abstractIn this paper, we consider the premarshalling problem, where items in a storage area have to be sorted for convenient retrieval. A new model for uncertainty is introduced, where the priority values induced by the retrieval sequence of the items are uncertain. We develop a robust optimization approach for this setting, study complexity issues, and provide different mixed-integer programming formulations. In a computational study using a wide range of benchmark instances from the literature, we investigate both the efficiency of the approach as well as the benefit and cost of robust solutions. We find that it is possible to achieve a considerably improved level of robustness by using just a few additional relocations in comparison to solutions which do not take uncertainty into account. (C) 2020 Elsevier B.V. All rights reserved.
dc.language.isoen
dc.publisherELSEVIER
dc.relation.ispartofEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
dc.subjectALGORITHM
dc.subjectBusiness & Economics
dc.subjectLogistics
dc.subjectManagement
dc.subjectMATHEMATICAL FORMULATION
dc.subjectOperations Research & Management Science
dc.subjectPremarshalling
dc.subjectRobust optimization
dc.subjectStorage
dc.subjectTREE-SEARCH PROCEDURE
dc.titleRobust optimization for premarshalling with uncertain priority classes
dc.typejournal article
dc.identifier.doi10.1016/j.ejor.2020.04.049
dc.identifier.isiISI:000541072800014
dc.description.volume287
dc.description.issue1
dc.description.startpage191
dc.description.endpage210
dc.identifier.eissn18726860
dc.publisher.placeRADARWEG 29, 1043 NX AMSTERDAM, NETHERLANDS
dcterms.isPartOf.abbreviationEur. J. Oper. Res.
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidKnSi808-
Show simple item record

Page view(s)

3
Last Week
0
Last month
0
checked on Apr 21, 2024

Google ScholarTM

Check

Altmetric