Improving Order-Picking Performance by Optimizing Order Batching in Multiple-Cross-Aisle Warehouse Systems: A Case Study from E-Commerce in China
被引:0
|
作者:
Zhao, Zhijie
论文数: 0引用数: 0
h-index: 0
机构:
Tsinghua Univ, Grad Sch Shenzhen, Res Ctr Modern Logist, Shenzhen, Peoples R ChinaTsinghua Univ, Grad Sch Shenzhen, Res Ctr Modern Logist, Shenzhen, Peoples R China
Zhao, Zhijie
[1
]
Yang, Peng
论文数: 0引用数: 0
h-index: 0
机构:
Tsinghua Univ, Grad Sch Shenzhen, Res Ctr Modern Logist, Shenzhen, Peoples R ChinaTsinghua Univ, Grad Sch Shenzhen, Res Ctr Modern Logist, Shenzhen, Peoples R China
Yang, Peng
[1
]
机构:
[1] Tsinghua Univ, Grad Sch Shenzhen, Res Ctr Modern Logist, Shenzhen, Peoples R China
order batching problem;
picker routing;
tabu search;
seed algorithm;
ALGORITHMS;
D O I:
暂无
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
This article explores the order batching problem (OBP), in warehouse of e-commerce companies. Based on the real E-commence warehouse case, we present a valid tabu search(TS) algorithm to determine how to group the orders in batches, with a greed-based seed heuristic method generating its initial solution. In tabu search, a modified combined picker routing algorithm for the multiple-cross-aisle picker routing problem is embedded in it to calculate the value of fitness function and evaluate the performance of the tabu algorithm. These algorithms are experimentally tested on real warehouse operational data cases from a B2C company warehouse. Comparing with the current applied operational patterns, our proposed methods are able to improve the order-picking efficiency greatly.