考虑多车配合的AutoStore系统订单拣选排序研究
Research on order picking sorting in the AutoStore system with multi-vehicle collaboration
马云峰 1崔宇昊 2邹雅倩 2胡依娜 2卢阳3
作者信息
- 1. 武汉科技大学管理学院,武汉 430065;武汉科技大学服务科学与工程研究中心,武汉 430065
- 2. 武汉科技大学管理学院,武汉 430065
- 3. 湖北普罗格科技股份有限公司,武汉 430000
- 折叠
摘要
为解决AutoStore系统中由于严格要求单辆小车参与整套拣货动作而导致的相同料箱多次翻拣及大量重复成本问题,本文提出堆垛检索概念并设计多车协同拣货作业流程,以减少对料箱的重复翻箱.基于该作业方式建立订单排序优化模型用于求解最优订单序列,并进一步设计了启发式算法SA用于大规模算例求解.数值实验显示,在小规模问题中,SA 算法与数学模型最优解的误差仅为 0.95%～3.5%;在大规模问题中,SA的性能高出现有方法 15%～72%.结果证明了该种作业流程的有效性及SA算法求解订单排序问题的优越性.
Abstract
To solve the problem of repeated picking of the same bins and significant redundant costs in the AutoStore system,which is caused by the strict requirement for a single vehicle to conduct the entire picking process,this paper proposes a concept of stack retrieval and designs a multi-vehicle collaborative picking workflow to reduce the repetitive operation of bins.Based on this operational approach,we establish an order sequencing optimization model to determine the optimal order sequence.Additionally,we design a heuristic algorithm SA to address large-scale instances of the problem.Numerical experiments reveal that,in small-scale scenarios,the SA algorithm yields an error ranging from 0.95%to 3.5%compared to the mathematical optimal solution.In large-scale scenarios,SA outperforms existing methods from 15%to 72%.These results convincingly demonstrate the effectiveness of this operational approach and the superior performance of the SA algorithm in solving the order sequencing problem.
关键词
运输系统工程/订单排序/启发式算法/AutoStore系统/多车协同Key words
transportation systems engineering/order sorting/heuristic algorithm/AutoStore system/multi-vehicle coordination引用本文复制引用
基金项目
教育部人文社会科学研究项目(19YJA630054)
湖北省教育厅哲学社会科学研究青年项目(20Q021)
湖北省自然科学基金青年基金(2020CFB142)
出版年
2024
NETL
NSTL
万方数据