关于Ratliff和Rosenthal矩形仓库拣货算法的一个过渡性注记
A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses
AI总结:
本文证明在矩形仓库中,存在不双倍穿越通道的最短拣货路径,从而改进了Ratliff和Rosenthal的线性算法。
摘要:
在拣货问题中,拣货员需在仓库中以最短路径收集若干商品。Ratliff和Rosenthal针对具有两条横向通道的仓库给出了线性时间算法。该算法允许路径双倍穿越整个通道。我们证明,在矩形仓库中,始终存在一条不双倍穿越通道的最短路径。
英文摘要:
In the order picking problem, a picker has to collect a number of products in a warehouse with a minimum length tour. Ratliff and Rosenthal gave a linear algorithm solving the order picking problem in the case where the warehouse has two cross aisles. Their algorithm allow the tour to double cross an entire aisle. We prove that, in rectangular warehouses, there always exists a minimum length tour which doesn't double cross an aisle.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。