论文标题
改进的联合订单批处理和采摘器路由问题的提高了
Improved formulations of the joint order batching and picker routing problem
论文作者
论文摘要
订单拾取是从仓库中的存储位置检索有序产品的过程。在采摘订单选择系统中，可以将两个或两个以上的客户订单分组并分配给一个选择器。然后，必须在选择过程中有关访问序列的路由决定。 （J.Won和S.Olafsson 2005）发现，与分别和顺序解决这两个问题相比，解决批处理和路由的综合问题使仓库经理可以更有效地组织订单拾取操作。因此，我们研究了该集成问题的数学编程公式。我们根据（Valle，Beasley和Da Cunha 2017）的发现提供了几种改进的问题，可以显着改善计算结果。更具体地说，我们重建连接性约束并在分支切割框架中生成新的切割平面。我们还通过研究图形表示的结构来讨论一些问题属性，并提出两种类型的其他约束。我们还考虑了此问题的无反转情况。我们通过构建不同的辅助图提出有效的配方。最后，我们为单块和多块仓库配置提供了用于公开可用测试问题的计算结果
Order picking is the process of retrieving ordered products from storage locations in warehouses. In picker-to-parts order picking systems, two or more customer orders may be grouped and assigned to a single picker. Then routing decision regarding the visiting sequence of items during a picking tour must be made. (J.Won and S.Olafsson 2005) found that solving the integrated problem of batching and routing enables warehouse managers to organize order picking operations more efficiently compared with solving the two problems separately and sequentially. We therefore investigate the mathematical programming formulation of this integrated problem. We present several improved formulations for the problem based on the findings of (Valle, Beasley, and da Cunha 2017), that can significantly improve computational results. More specifically, we reconstruct the connectivity constraints and generate new cutting planes in our branch-and-cut framework. We also discuss some problem properties by studying the structure of the graphical representation, and we present two types of additional constraints. We also consider the no-reversal case of this problem. We present efficient formulations by building different auxiliary graphs. Finally, we present computational results for publicly available test problems for single-block and multiple-block warehouse configurations
