期刊
ENGINEERING OPTIMIZATION
卷 50, 期 11, 页码 1941-1962出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/0305215X.2017.1419346
关键词
Storage assignment problem; order batching problem; product similarity; Kiva mobile fulfilment system
资金
- National Natural Science Foundation of China [51705282, 71472108]
- Shenzhen Municipal Science and Technology Innovation Committee [JCYJ20160531195231085]
- Ministry of Science and Technology of the People's Republic of China [2014IM010100]
This article studies the storage assignment and order batching problem in the Kiva mobile fulfilment system. The storage assignment model aims to decide which product to put in which pod to maximize the product similarity and the order batching model aims to minimize the number of visits of pods. To solve the order batching problem, a heuristic is proposed, where a batch schedule is initialized with the objective of maximizing the order association or minimizing order alienation and improved by variable neighbourhood search. Computational experiments are conducted to verify the performance of the proposed model and algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据