Travel time model for multi-deep automated storage and retrieval system with a homogeneous allocation structure

IF 1.9 4区 管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Naval Research Logistics Pub Date : 2021-01-01 DOI:10.23773/2021_5
T. Lehmann, Jakob Hußmann
{"title":"Travel time model for multi-deep automated storage and retrieval system with a homogeneous allocation structure","authors":"T. Lehmann, Jakob Hußmann","doi":"10.23773/2021_5","DOIUrl":null,"url":null,"abstract":"This paperpresentsa travel time model for multi-deep AS/RS, which determines the average travel times during a single command storage or retrieval and a dual command cycle. The model can determine the relocation probability, the number of expected relocations and the travel times in storage channels itself exactly dependingon the stock filling level. The travel time model assumes random storage policies. Travel time determination is trivial for single-deep AS/RS, because no relocation necessity applies and it gets more complicated with an increasing depth of the storage racks. The deeper goods can be stored, the more goods can potentially be stored in front of each other in one storage channel. This leads to relocation operations of blocking goods and causes higher total travel times. The higher the stock filling level, the higher is the relocation probability and the number of necessary relocations. The calculation of relocation probabilities in this work is based on a homogeneousstorage good allocation structure which leads to a symmetric allocation of storage goods and enables an easy modelling of travel times. This paper presents a travel time model with a continuousstorage rack approximation of a multi-deepAS/RS in closed-form expression. Furthermore, the storage channel allocation probabilities are mathematically proven. The relocation probability for storage operations and retrieval operations are the same. Finally, the derived travel time models and relocation probabilities are verified by simulation.","PeriodicalId":49772,"journal":{"name":"Naval Research Logistics","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.23773/2021_5","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 5

Abstract

This paperpresentsa travel time model for multi-deep AS/RS, which determines the average travel times during a single command storage or retrieval and a dual command cycle. The model can determine the relocation probability, the number of expected relocations and the travel times in storage channels itself exactly dependingon the stock filling level. The travel time model assumes random storage policies. Travel time determination is trivial for single-deep AS/RS, because no relocation necessity applies and it gets more complicated with an increasing depth of the storage racks. The deeper goods can be stored, the more goods can potentially be stored in front of each other in one storage channel. This leads to relocation operations of blocking goods and causes higher total travel times. The higher the stock filling level, the higher is the relocation probability and the number of necessary relocations. The calculation of relocation probabilities in this work is based on a homogeneousstorage good allocation structure which leads to a symmetric allocation of storage goods and enables an easy modelling of travel times. This paper presents a travel time model with a continuousstorage rack approximation of a multi-deepAS/RS in closed-form expression. Furthermore, the storage channel allocation probabilities are mathematically proven. The relocation probability for storage operations and retrieval operations are the same. Finally, the derived travel time models and relocation probabilities are verified by simulation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有均匀分配结构的多深度自动存取系统的行程时间模型
提出了一种多深度AS/RS的行程时间模型,该模型确定了单指令存储或检索和双指令周期的平均行程时间。该模型能准确地根据库存填充水平确定货物的搬迁概率、期望搬迁次数和在仓储通道内的行程时间。旅行时间模型假设存储策略是随机的。对于单深AS/RS来说,行程时间的确定是微不足道的,因为不需要重新定位,并且随着存储架深度的增加,它变得更加复杂。货物可以储存得越深,在一个存储通道中,就有越多的货物可能被存放在彼此前面。这将导致阻塞货物的重新安置作业,并导致更高的总旅行时间。库存填充水平越高,搬迁概率和必要的搬迁次数就越高。在这项工作中,重新安置概率的计算是基于均匀的存储良好分配结构,这种结构导致存储货物的对称分配,并使旅行时间的建模变得容易。本文提出了一个具有连续存储架近似的多深度as /RS行程时间模型的封闭表达式。此外,用数学方法证明了存储通道分配概率。存储操作和检索操作的重定位概率是相同的。最后,通过仿真验证了所导出的行程时间模型和重新定位概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Naval Research Logistics
Naval Research Logistics 管理科学-运筹学与管理科学
CiteScore
4.20
自引率
4.30%
发文量
47
审稿时长
8 months
期刊介绍: Submissions that are most appropriate for NRL are papers addressing modeling and analysis of problems motivated by real-world applications; major methodological advances in operations research and applied statistics; and expository or survey pieces of lasting value. Areas represented include (but are not limited to) probability, statistics, simulation, optimization, game theory, quality, scheduling, reliability, maintenance, supply chain, decision analysis, and combat models. Special issues devoted to a single topic are published occasionally, and proposals for special issues are welcomed by the Editorial Board.
期刊最新文献
Partial information sharing in supply chains with ARMA demand Efficient online estimation and remaining useful life prediction based on the inverse Gaussian process Double‐sided queues and their applications to vaccine inventory management Optimal condition‐based parameter learning and mission abort decisions Single machine scheduling with the total weighted late work and rejection cost
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1