多库区单元载荷预整理系统排序
Sorting multibay block stacking storage systems
AI总结:
本文提出一种两步方法,用于多库区单元载荷预整理问题,通过确定堆栈访问方向和移动序列,提高访问效率并减少排序工作量。
摘要:
自主移动机器人(AMRs)越来越多地用于自动化内部物流操作。AMRs的一个关键特性是其可用性,允许其全天候运行。本文解决多库区单元载荷预整理问题,将预整理从单库区扩展到具有多个库区的更大仓库配置。预整理利用非高峰时段对块堆叠仓库进行排序,以应对未来的订单。这些更大的仓库配置不仅需要最小化移动次数,还需要在做出排序决策时考虑距离或时间。我们提出的解决方案基于一个两步方法,首先确定每个堆栈的访问方向,然后找到排序仓库的移动序列。除了适应现有的整合网络流模型和扩展A*算法的方法外,我们还提出了一个精确约束编程方法,用于问题解决过程的第二阶段。结果表明,所提出的解决方案有效提高了单元载荷的访问时间,并减少了具有多个库区的块堆叠仓库的排序努力。
英文摘要:
Autonomous mobile robots (AMRs) are increasingly used to automate operations in intralogistics. One crucial feature of AMRs is their availability, allowing them to operate 24/7. This work addresses the multibay unit load pre-marshalling problem, which extends pre-marshalling from a single bay to larger warehouse configurations with multiple bays. Pre-marshalling leverages off-peak time intervals to sort a block stacking warehouse in anticipation of future orders. These larger warehouse configurations require not only the minimization of the number of moves but also the consideration of distance or time when making sorting decisions. Our proposed solution for the multibay unit load pre-marshalling problem is based on our two-step approach that first determines the access direction for each stack and then finds a sequence of moves to sort the warehouse. In addition to adapting the existing approach that integrates a network flow model and an extended A* algorithm, we additionally present an exact constraint programming approach for the second stage of the problem-solving process. The results demonstrate that the presented solution approach effectively enhances the access time of unit loads and reduces the sorting effort for block stacking warehouses with multiple bays.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。