Academic Journal
Προβολή σε EDS

Digging Deep: Finding and Maximizing the Throughput Capacity of Multideep Storage Systems.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Digging Deep: Finding and Maximizing the Throughput Capacity of Multideep Storage Systems.
Συγγραφείς: Lehmann, Timo1 (AUTHOR) timo.lehmann@kit.edu, de Koster, René2 (AUTHOR) rkoster@rsm.nl
Πηγή: Transportation Science (INFORMS). Mar/Apr2026, Vol. 60 Issue 2, p343-365. 23p.
Θεματικοί όροι: *Automated storage retrieval systems, *Markov processes, Storage
Περίληψη: Multideep storage systems are space-efficient storage solutions for a variety of industries and applications, such as in retail, spare parts and pharmaceutical logistics, and container terminals. They include robotic compact storage and retrieval (RCS/R) and multideep automated storage and retrieval (AS/R) systems. In such systems, multiple loads can be stored behind or above each other in a single lane, which leads to high space utilization. However, loads must be reshuffled if they block a requested load. This increases the command cycle time. We use Markov-chain models to estimate the steady state of the storage system and derive the travel time, which is then used in a closed queueing network to estimate the throughput capacity with a given number of robots. We built these models using four storage assignment strategies, three load reshuffling strategies, and two retrieval load selection strategies, incorporating the access frequency of the products and allowing multiple stored loads per product. Four strategy combinations are analyzed, including the current AutoStore strategy. We find that when information about the access frequency and number of loads per product is available, the throughput capacity can be increased significantly by properly storing and reshuffling loads to better positions. Based on the throughput models, we optimize the rack layout yielding maximum throughput capacity for two industry cases. Furthermore, we provide managerial insights on storage assignment, reshuffle, and retrieval load selection strategies for multideep storage systems. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0690. [ABSTRACT FROM AUTHOR]
Copyright of Transportation Science (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων: Business Source Index
FullText Text:
  Availability: 0
Header DbId: bsx
DbLabel: Business Source Index
An: 192378798
RelevancyScore: 1470
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1470.35424804688
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Digging Deep: Finding and Maximizing the Throughput Capacity of Multideep Storage Systems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Lehmann%2C+Timo%22">Lehmann, Timo</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> timo.lehmann@kit.edu</i><br /><searchLink fieldCode="AR" term="%22de+Koster%2C+René%22">de Koster, René</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> rkoster@rsm.nl</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Transportation+Science+%28INFORMS%29%22">Transportation Science (INFORMS)</searchLink>. Mar/Apr2026, Vol. 60 Issue 2, p343-365. 23p.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Automated+storage+retrieval+systems%22">Automated storage retrieval systems</searchLink><br />*<searchLink fieldCode="DE" term="%22Markov+processes%22">Markov processes</searchLink><br /><searchLink fieldCode="DE" term="%22Storage%22">Storage</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Multideep storage systems are space-efficient storage solutions for a variety of industries and applications, such as in retail, spare parts and pharmaceutical logistics, and container terminals. They include robotic compact storage and retrieval (RCS/R) and multideep automated storage and retrieval (AS/R) systems. In such systems, multiple loads can be stored behind or above each other in a single lane, which leads to high space utilization. However, loads must be reshuffled if they block a requested load. This increases the command cycle time. We use Markov-chain models to estimate the steady state of the storage system and derive the travel time, which is then used in a closed queueing network to estimate the throughput capacity with a given number of robots. We built these models using four storage assignment strategies, three load reshuffling strategies, and two retrieval load selection strategies, incorporating the access frequency of the products and allowing multiple stored loads per product. Four strategy combinations are analyzed, including the current AutoStore strategy. We find that when information about the access frequency and number of loads per product is available, the throughput capacity can be increased significantly by properly storing and reshuffling loads to better positions. Based on the throughput models, we optimize the rack layout yielding maximum throughput capacity for two industry cases. Furthermore, we provide managerial insights on storage assignment, reshuffle, and retrieval load selection strategies for multideep storage systems. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0690. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Transportation Science (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=192378798
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1287/trsc.2024.0690
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 23
        StartPage: 343
    Subjects:
      – SubjectFull: Automated storage retrieval systems
        Type: general
      – SubjectFull: Markov processes
        Type: general
      – SubjectFull: Storage
        Type: general
    Titles:
      – TitleFull: Digging Deep: Finding and Maximizing the Throughput Capacity of Multideep Storage Systems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Lehmann, Timo
      – PersonEntity:
          Name:
            NameFull: de Koster, René
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar/Apr2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 00411655
          Numbering:
            – Type: volume
              Value: 60
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Transportation Science (INFORMS)
              Type: main
ResultId 1