期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 243, 期 1, 页码 142-155出版社
ELSEVIER
DOI: 10.1016/j.ejor.2014.11.025
关键词
Warehouse management; Order Batching Problem; Mixed Integer Linear Programming; Local search
资金
- Turkish Scientific and Technological Research Council Research [107M462, 109M139]
- Galatasaray University Scientific Research Project [14.402.003]
In this work we deal with the Order Batching Problem (OBP) considering traversal, return and midpoint routing policies. For the first time, we introduce Mixed Integer Linear Programming (MILP) formulations for these three variants of the OBP. We also suggest an efficient Iterated Local Search Algorithm with Tabu Thresholding (ILST). According to our extensive computational experiments on standard and randomly generated instances we can say that the proposed ILST yields an outstanding performance in terms of both accuracy and efficiency. (C) 2014 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据