Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/306375 
Erscheinungsjahr: 
2023
Quellenangabe: 
[Journal:] OR Spectrum [ISSN:] 1436-6304 [Volume:] 45 [Issue:] 4 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2023 [Pages:] 1071-1111
Verlag: 
Springer, Berlin, Heidelberg
Zusammenfassung: 
We consider the block relocation problem (BRP), a combinatorial optimization problem that may arise in storage systems where items are organized in stacks. The objective is to retrieve all items in a predefined order with a minimal number of relocations. It can be distinguished between a restricted and an unrestricted version of the BRP. While in the restricted BRP (R-BRP) only relocations of items located above the item to be retrieved next are permitted, in the unrestricted BRP (U-BRP) all possible relocations are allowed. Existing exact methods concerning the BRP are frequently search-based methods which appear to be very effective. Nevertheless, recent literature concerning the R-BRP has shown that model-based methods can be competitive and therefore should also be taken into consideration. In this paper, we propose a new model-based approach for the U-BRP. It eliminates the fact that the number of variables is increasing with the number of necessary relocations; a disadvantage most mathematical models for the U-BRP have in common.
Schlagwörter: 
Combinatorial optimization
Block relocation problem
Mixed integer linear model
Row generation
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Dokumentversion: 
Published Version

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.