期刊
COMPUTERS & OPERATIONS RESEARCH
卷 100, 期 -, 页码 117-127出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2018.07.002
关键词
Integer programming; Order picking; Steiner TSP; TSP; Dynamic programming
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. (C) 2018 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据