大型集装箱的联合订货分批和拣货员路径问题的求解
Solving the Joint Order Batching and Picker Routing Problem for Large Instances
摘要：
在这项工作中，我们研究的问题，订单配送和拣货员在仓库存储区的路由。众所周知，这些问题是资本和劳动密集型的，并且通常占仓库运营成本的相当大的一部分。在这里，我们考虑在线杂货店购物的情况下，订单可能包括几十个项目。我们提出的问题，介绍和解决问题的解决方法，提出了解决问题的方法，利用mathematicistics和路由mathematics。在由8到30个通道组成的大型模拟仓库实例中，用1到4个块来解决多达50个订单的问题。所提出的方法被证明具有相对较短的计算时间相比，最佳解决问题。特别是，我们发现，一个建议的方法，利用最佳求解器路由产生较差的结果比方法，利用路由算法。
英文摘要：
In this work, we investigate the problem of order batching and picker routing in warehouse storage areas. These problems are known to be capital and labour intensive, and often contribute to a sizable fraction of warehouse operating costs. Here, we consider the case of online grocery shopping where orders may consist of dozens of items. We present the problem introduced and tackle the issue of solving the problem heuristically with proposed methods of solving that utilize batching and routing heuristics. Instances with up to 50 orders were solved heuristically in large simulated warehouse instances consisting of 8 to 30 aisles, with 1 to 4 blocks. The proposed methods were shown to have relatively short computation times as compared to optimally solving the problem in. In particular, we showed that a proposed method which utilizes an optimal solver for routing yielded poorer results than methods that utilize routing heuristics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
