A Hungarian-based Heuristic for Dual-command Storage/Retrieval in Single-machine Flow-rack AS/RS with Determined Locations

Tingyu Zhang, Zhuxi Chen, Li Li
{"title":"A Hungarian-based Heuristic for Dual-command Storage/Retrieval in Single-machine Flow-rack AS/RS with Determined Locations","authors":"Tingyu Zhang, Zhuxi Chen, Li Li","doi":"10.1109/ICIST52614.2021.9440613","DOIUrl":null,"url":null,"abstract":"The single-machine flow-rack (SMFR) automated storage and retrieval system (AS/RS) has high storage density, high utilization of floor space, low investment cost, and low operation cost. Based on the determined storage and retrieval locations, the generation of dual-command cycle (DC) operation in the SMFR AS/RS can be modeled as an assignment problem, which can be solved by the Hungarian method. Therefore, a novel heuristic, denoted as LSH (Less-Shelves Hungarian), modified from Hungarian is proposed in this paper to generate high performance DC operations in SMFR AS/RS with determined storage and retrieval locations. The aim of the proposing heuristic is to minimize the total travel time of storage and retrieval operations. Simulation experiments are executed to analyze and evaluate the performance of LSH. Experimental results verify that the proposed heuristic has better effectiveness and efficiency than existed heuristic for the same problem.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"1998 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 11th International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST52614.2021.9440613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The single-machine flow-rack (SMFR) automated storage and retrieval system (AS/RS) has high storage density, high utilization of floor space, low investment cost, and low operation cost. Based on the determined storage and retrieval locations, the generation of dual-command cycle (DC) operation in the SMFR AS/RS can be modeled as an assignment problem, which can be solved by the Hungarian method. Therefore, a novel heuristic, denoted as LSH (Less-Shelves Hungarian), modified from Hungarian is proposed in this paper to generate high performance DC operations in SMFR AS/RS with determined storage and retrieval locations. The aim of the proposing heuristic is to minimize the total travel time of storage and retrieval operations. Simulation experiments are executed to analyze and evaluate the performance of LSH. Experimental results verify that the proposed heuristic has better effectiveness and efficiency than existed heuristic for the same problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于匈牙利语的单机流架AS/RS双指令存取启发式算法
单机流架(SMFR)自动化存取系统(AS/RS)具有存储密度高、占地面积利用率高、投资成本低、运行成本低等优点。在确定存储和检索位置的基础上,SMFR AS/RS中双命令周期(DC)操作的生成可以建模为一个分配问题,该问题可以用匈牙利方法求解。因此,本文提出了一种由Hungarian改进的启发式算法LSH (Less-Shelves Hungarian),用于在确定存储和检索位置的SMFR as /RS中生成高性能的DC操作。提出的启发式算法的目的是最小化存储和检索操作的总行程时间。通过仿真实验对LSH的性能进行了分析和评价。实验结果表明,对于相同的问题,所提出的启发式算法比现有的启发式算法具有更好的有效性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Top-k Graph Similarity Search Based on Hierarchical Inverted Index Disturbance observer based on NTSM output tracking control for second-order systems with power integrators and input quantization Alzheimer’s disease diagnosis method based on convolutional neural network using key slices voting Distributed Constrained Online Optimization with Noisy Communication Molecular Diagnosis: And using Ubiquitous Transcription Factor and MAPK to Recover Thyroid Cells of Hyperthyroidism and Heart
×
引用
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