论文标题
在大规模实例中解决联合订单批处理和选择器路由问题
Solving the Joint Order Batching and Picker Routing Problem for Large Instances
论文作者
论文摘要
在这项工作中，我们研究了仓库存储区域中订单批处理和采摘器路由的问题。已知这些问题是资本和劳动密集型，通常会导致相当一部分仓库的运营成本。在这里，我们考虑了在线杂货店购物的情况，其中订单可能包括数十个项目。 我们提出了解决问题的问题，并解决了使用批处理和路由启发式方法来解决该问题的问题。在大型模拟仓库实例中，通过8至30个过道，有1至4个街区的大型仓库实例，在大型模拟仓库实例中通过启发式解决了启发式的实例。与最佳解决该问题相比，所提出的方法的计算时间相对较短。特别是，我们表明，使用最佳求解器的方法比使用路由启发式方法的方法，该方法利用最佳求解器产生的结果较差。
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.
