拣选问题的精确算法
Exact algorithms for the order picking problem
摘要:
订单拣选是在最短的时间内将一组产品收集到仓库中的问题。由于其时间成本和劳动力成本,它目前是供应链中的一个主要瓶颈。本文提出了两个精确有效的算法。首先,通过预处理和有效的不等式加强了混合整数规划的稀疏形式。其次,提出了一种动态规划方法,将已知的算法推广到两个或三个交叉过道,并进行了实验评估。这些算法的性能进行了报告,并与旅行商问题(TSP)求解协和。
英文摘要:
Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force. This article presents two exact and effective algorithms for this problem. Firstly, a sparse formulation in mixed-integer programming is strengthened by preprocessing and valid inequalities. Secondly, a dynamic programming approach generalizing known algorithms for two or three cross-aisles is proposed and evaluated experimentally. Performances of these algorithms are reported and compared with the Traveling Salesman Problem (TSP) solver Concorde.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。