A step-by-step dual cycle sequencing method for unit-load automated storage and retrieval systems
A step-by-step dual cycle sequencing method for unit-load automated storage and retrieval systems
复制标题
DOI：
10.1016/j.cie.2012.06.009
复制
发表时间：
2012-12
期刊：
影响因子：
--
通讯作者：
Khalid Hachemi;Z. Sari;N. Ghouali
中科院分区：
文献类型：
--
作者：
Khalid Hachemi;Z. Sari;N. Ghouali
在自动化存储和检索系统中的请求排序是许多文献研究的主题。然而，这些研究假设，要存储和检索的项目的位置是已知的，排序问题包括在确定这些位置之间的最小旅行时间的路线。实际上，对于取回请求，物品可以在货架的多个位置中，因此存在与该物品相关联的一组位置，而不仅仅是货架中的一个预定位置。在本文中，我们处理的排序问题，所需的产品可以在几个机架位置，有一组空的位置。因此，检索和存储位置不是先验已知的。我们通过双循环（DC）的最小旅行时间进行排序。一种逐步工作的优化方法，以确定每个DC和根据存储和检索请求，要存储的项目的位置和要检索的项目的位置，允许最小的DC时间。存储请求在FCFS中进行处理，检索请求按照波序进行分块收集。
The sequencing of requests in an automated storage and retrieval system was the subject of many studies in literature. However, these studies assumed that the locations of items to be stored and retrieved are known and the sequencing problem consisted in determining a route of minimal travel time between these locations. In reality, for a retrieval request, an item can be in multiple locations of the rack and so there is a set of locations associated with this item and not only one predetermined location in the rack. In this paper, we deal with the sequencing problem where a required product can be in several rack locations and there is a set of empty locations. Consequently, the retrieval and storage locations are not known a priori. We sequence by the minimum travel time of a double cycle (DC). An optimization method working step-by-step is developed to determine for each DC and according to storage and retrieval requests, the location of the item to be stored and the location of the item to be retrieved allowing the minimum DC time. The storage requests are processed in FCFS and retrieval requests retrievals requests are gathered by block according to wave sequencing.