经典与现代仓库中的单拣选人路径问题建模
Modeling Single Picker Routing Problems in Classical and Modern Warehouses
摘要：
标准的单拣选员路径问题（SPRP）是在一个矩形的单块仓库中寻找一组给定物品的成本最小的路径，该仓库具有平行的拣选通道和一个专用的存储策略，即每个拣选员只能从仓库中的一个存储位置获得。我们提出了一个紧凑的公式，放弃了经典的subtour消除约束，直接利用两个性质的最佳采摘旅游中使用的动态规划算法的Ratliff和Rosenthal（1983）。我们将该公式扩展到现代电子商务仓库中普遍存在的三个重要设置：分散存储，拣选机和推车的解耦以及多个终端仓库。在数值研究中，我们的配方优于现有的标准SPRP配方从文献中，并证明能够在短的运行时间内解决大型实例。现实大小的三个问题扩展的实例也可以解决低计算工作量。我们发现，解耦的采摘和车可以导致大量的成本节约取决于速度和能力的采摘时，独自旅行，而额外的终端仓库在一个单一的块仓库的好处相当有限。
英文摘要：
The standard single picker routing problem (SPRP) seeks the cost-minimal tour to collect a set of given articles in a rectangular single-block warehouse with parallel picking aisles and a dedicated storage policy, i.e, each SKU is only available from one storage location in the warehouse. We present a compact formulation that forgoes classical subtour elimination constraints by directly exploiting two of the properties of an optimal picking tour used in the dynamic programming algorithm of Ratliff and Rosenthal (1983). We extend the formulation to three important settings prevalent in modern e-commerce warehouses: scattered storage, decoupling of picker and cart, and multiple end depots. In numerical studies, our formulation outperforms existing standard SPRP formulations from the literature and proves able to solve large instances within short runtimes. Realistically sized instances of the three problem extensions can also be solved with low computational effort. We find that decoupling of picker and cart can lead to substantial cost savings depending on the speed and capacity of the picker when traveling alone, whereas additional end depots have rather limited benefits in a single-block warehouse.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
