基于强化学习的梭式存储检索系统存储过程调度

Lei Luo;Ning Zhao;Gabriel Lodewijks
{"title":"基于强化学习的梭式存储检索系统存储过程调度","authors":"Lei Luo;Ning Zhao;Gabriel Lodewijks","doi":"10.23919/CSMS.2021.0013","DOIUrl":null,"url":null,"abstract":"The Shuttle-Based Storage and Retrieval System (SBS/RS) has been widely studied because it is currently the most efficient automated warehousing system. Most of the related existing studies are focused on the prediction and improvement of the efficiency of such a system at the design stage. Hence, the control of existing SBS/RSs has been rarely investigated. In existing SBS/RSs, some empirical rules, such as storing loads column by column, are used to control or schedule the storage process. The question is whether or not the control of the storage process in an existing system can be improved further by using a different approach. The storage process is controlled to minimize the makespan of storing a series of loads into racks. Empirical storage rules are easy to control, but they do not reach the minimum makespan. In this study, the performance of a control system that uses reinforcement learning to schedule the storage process of an SBS/RS with fixed configurations is evaluated. Specifically, a reinforcement learning algorithm called the actor-critic algorithm is used. This algorithm is made up of two neural networks and is effective in making decisions and updating itself. It can also reduce the makespan relative to the existing empirical rules used to improve system performance. Experiment results show that in an SBS/RS comprising six columns and six tiers and featuring a storage capacity of 72 loads, the actor-critic algorithm can reduce the makespan by 6.67% relative to the column-by-column storage rule. The proposed algorithm also reduces the makespan by more than 30% when the number of loads being stored is in the range of 7-45, which is equal to 9.7%-62.5% of the systems' storage capacity.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"1 2","pages":"131-144"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.23919/CSMS.2021.0013","citationCount":"3","resultStr":"{\"title\":\"Scheduling Storage Process of Shuttle-Based Storage and Retrieval Systems Based on Reinforcement Learning\",\"authors\":\"Lei Luo;Ning Zhao;Gabriel Lodewijks\",\"doi\":\"10.23919/CSMS.2021.0013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Shuttle-Based Storage and Retrieval System (SBS/RS) has been widely studied because it is currently the most efficient automated warehousing system. Most of the related existing studies are focused on the prediction and improvement of the efficiency of such a system at the design stage. Hence, the control of existing SBS/RSs has been rarely investigated. In existing SBS/RSs, some empirical rules, such as storing loads column by column, are used to control or schedule the storage process. The question is whether or not the control of the storage process in an existing system can be improved further by using a different approach. The storage process is controlled to minimize the makespan of storing a series of loads into racks. Empirical storage rules are easy to control, but they do not reach the minimum makespan. In this study, the performance of a control system that uses reinforcement learning to schedule the storage process of an SBS/RS with fixed configurations is evaluated. Specifically, a reinforcement learning algorithm called the actor-critic algorithm is used. This algorithm is made up of two neural networks and is effective in making decisions and updating itself. It can also reduce the makespan relative to the existing empirical rules used to improve system performance. Experiment results show that in an SBS/RS comprising six columns and six tiers and featuring a storage capacity of 72 loads, the actor-critic algorithm can reduce the makespan by 6.67% relative to the column-by-column storage rule. The proposed algorithm also reduces the makespan by more than 30% when the number of loads being stored is in the range of 7-45, which is equal to 9.7%-62.5% of the systems' storage capacity.\",\"PeriodicalId\":65786,\"journal\":{\"name\":\"复杂系统建模与仿真(英文)\",\"volume\":\"1 2\",\"pages\":\"131-144\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.23919/CSMS.2021.0013\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"复杂系统建模与仿真(英文)\",\"FirstCategoryId\":\"1089\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/9502052/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"复杂系统建模与仿真(英文)","FirstCategoryId":"1089","ListUrlMain":"https://ieeexplore.ieee.org/document/9502052/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

基于航天飞机的仓储检索系统(SBS/RS)是目前最高效的自动化仓储系统,受到了广泛的研究。现有的相关研究大多集中在系统设计阶段对系统效率的预测和提高。因此,对现有SBS/RSs的控制很少进行研究。在现有的SBS/RSs中,使用一些经验规则(例如逐列存储负载)来控制或调度存储过程。问题是是否可以通过使用不同的方法进一步改善现有系统中存储过程的控制。对存储过程进行控制,以最小化将一系列负载存储到机架中的最大时间跨度。经验存储规则易于控制,但不能达到最小最大完工时间。在本研究中,使用强化学习来调度固定配置的SBS/RS的存储过程的控制系统的性能进行了评估。具体来说,使用了一种称为actor-critic算法的强化学习算法。该算法由两个神经网络组成,具有有效的决策和自我更新能力。相对于用于提高系统性能的现有经验规则,它还可以减少完工时间。实验结果表明,在包含6列6层、存储容量为72负载的SBS/RS中,actor- critical算法相对于逐列存储规则可将makespan缩短6.67%。当存储的负载数量在7 ~ 45个之间时,该算法可将最大运行时间缩短30%以上,相当于系统存储容量的9.7% ~ 62.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scheduling Storage Process of Shuttle-Based Storage and Retrieval Systems Based on Reinforcement Learning
The Shuttle-Based Storage and Retrieval System (SBS/RS) has been widely studied because it is currently the most efficient automated warehousing system. Most of the related existing studies are focused on the prediction and improvement of the efficiency of such a system at the design stage. Hence, the control of existing SBS/RSs has been rarely investigated. In existing SBS/RSs, some empirical rules, such as storing loads column by column, are used to control or schedule the storage process. The question is whether or not the control of the storage process in an existing system can be improved further by using a different approach. The storage process is controlled to minimize the makespan of storing a series of loads into racks. Empirical storage rules are easy to control, but they do not reach the minimum makespan. In this study, the performance of a control system that uses reinforcement learning to schedule the storage process of an SBS/RS with fixed configurations is evaluated. Specifically, a reinforcement learning algorithm called the actor-critic algorithm is used. This algorithm is made up of two neural networks and is effective in making decisions and updating itself. It can also reduce the makespan relative to the existing empirical rules used to improve system performance. Experiment results show that in an SBS/RS comprising six columns and six tiers and featuring a storage capacity of 72 loads, the actor-critic algorithm can reduce the makespan by 6.67% relative to the column-by-column storage rule. The proposed algorithm also reduces the makespan by more than 30% when the number of loads being stored is in the range of 7-45, which is equal to 9.7%-62.5% of the systems' storage capacity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.80
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信