动态订单到达情况下订单分拣操作中综合优化价值的实际研究
IF 1.6
4区 计算机科学
Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
引用次数: 0
摘要
对于承诺提供高水平客户服务的仓库来说，优化订单分拣操作是不可或缺的。虽然文献中已经确定并研究了许多需要改进的领域，但学术界与实践之间仍存在很大差距。为了缩小这一差距，我们与比利时的一家零配件仓库合作开展了一项案例研究。在这项研究中，我们利用实际仓库布局和真实订单数据，优化了该公司的订单分拣操作。我们采用了最先进的在线集成订单分批、拣选机路由和批次调度算法，以考虑多种现实限制因素。更具体地说，该算法考虑了新订单的动态到达，并遵守了分拣装置的容量约束。此外，还研究了一种新的等待策略，即订单拣选人员可以暂时推迟某些订单，因为将这些订单与未来可能到达的订单结合起来，可以实现更高效的整体拣选性能。最后，通过方差分析将当前操作策略的性能与种子批处理启发式算法和我们的元启发式算法的性能进行了比较。结果表明，如果采用新的优化算法，订单拣选人员的数量可以减少 12.5%，同时还能提高客户服务水平。本文章由计算机程序翻译，如有差异，请以英文原文为准。
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals
Optimizing the order picking operations is indispensable for warehouses that promise a high customer service level. While many areas for improvement have been identified and studied in the literature, a large gap remains between academia and practice. To help with closing this gap, we perform a case‐study in collaboration with a spare‐parts warehouse in Belgium. In this study, we optimize the order picking operations of the company, using the actual warehouse layout and real order data. A state‐of‐the‐art online integrated order batching, picker routing and batch scheduling algorithm is adapted to consider multiple real‐life constraints. More specifically, the dynamic arrival of new orders is considered, and a capacity constraint on the sorting installation should be respected. Furthermore, a new waiting strategy is studied in which order pickers can temporarily postpone certain orders, as combining them with possible future order arrivals may allow for more efficient overall picking performance. Finally, the performance of the current operating policy is compared with that of both a seed batching heuristic and our metaheuristic algorithm by use of an ANOVA analysis. The results indicate that the number of order pickers can be reduced by 12.5% if the new optimization algorithm is used, accompanied by an improvement in the offered customer service level.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。
去求助
来源期刊
Networks
工程技术-计算机：硬件
CiteScore
4.40
自引率
9.50%
发文量
46
审稿时长
12 months
期刊介绍：
Network problems are pervasive in our modern technological society, as witnessed by our reliance on physical networks that provide power, communication, and transportation. As well, a number of processes can be modeled using logical networks, as in the scheduling of interdependent tasks, the dating of archaeological artifacts, or the compilation of subroutines comprising a large computer program. Networks provide a common framework for posing and studying problems that often have wider applicability than their originating context.
The goal of this journal is to provide a central forum for the distribution of timely information about network problems, their design and mathematical analysis, as well as efficient algorithms for carrying out optimization on networks. The nonstandard modeling of diverse processes using networks and network concepts is also of interest. Consequently, the disciplines that are useful in studying networks are varied, including applied mathematics, operations research, computer science, discrete mathematics, and economics.
Networks publishes material on the analytic modeling of problems using networks, the mathematical analysis of network problems, the design of computationally efficient network algorithms, and innovative case studies of successful network applications. We do not typically publish works that fall in the realm of pure graph theory (without significant algorithmic and modeling contributions) or papers that deal with engineering aspects of network design. Since the audience for this journal is then necessarily broad, articles that impact multiple application areas or that creatively use new or existing methodologies are especially appropriate. We seek to publish original, well-written research papers that make a substantive contribution to the knowledge base. In addition, tutorial and survey articles are welcomed. All manuscripts are carefully refereed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
