{"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.