{"title":"基于匈牙利语的单机流架AS/RS双指令存取启发式算法","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":"{\"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}","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
摘要
单机流架(SMFR)自动化存取系统(AS/RS)具有存储密度高、占地面积利用率高、投资成本低、运行成本低等优点。在确定存储和检索位置的基础上，SMFR AS/RS中双命令周期(DC)操作的生成可以建模为一个分配问题，该问题可以用匈牙利方法求解。因此，本文提出了一种由Hungarian改进的启发式算法LSH (Less-Shelves Hungarian)，用于在确定存储和检索位置的SMFR as /RS中生成高性能的DC操作。提出的启发式算法的目的是最小化存储和检索操作的总行程时间。通过仿真实验对LSH的性能进行了分析和评价。实验结果表明，对于相同的问题，所提出的启发式算法比现有的启发式算法具有更好的有效性和效率。
A Hungarian-based Heuristic for Dual-command Storage/Retrieval in Single-machine Flow-rack AS/RS with Determined Locations
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
