Author(s)

Mengcheng Guan^*, Zhenping Li

College of Information, Beijing Wuzi University, Beijing, China.

This article studies the pod layout problem in the Kiva mobile fulfillment system which adopts the synchronized zoning strategy. An integer programming model for the pod layout problem is formulated under the premise of knowing the relationship of the pods and items. A three-stage algorithm is proposed based on the Spectral Clustering algorithm. Firstly, the pod similarity matrix and the Laplacian matrix are constructed according to the relationship of the pods and items. Secondly, the pods are clustered by the Spectral Clustering algorithm and assigned to each zone based on the cluster results. Finally, the exact locations of pods in each zone are determined by the historical retrieval frequency of items, using the real data of a large-scale Kiva mobile fulfillment system to simulate and calculate the order picking efficiency before and after the adjustment of the pod layout. The results showed that the pod layout using synchronized zoning strategy can effectively improve the picking efficiency.

Pod Layout Problem, Spectral Clustering Algorithm, Kiva Mobile Fulfillment System

Guan, M. and Li, Z. (2018) Pod Layout Problem in Kiva Mobile Fulfillment System Using Synchronized Zoning. Journal of Applied Mathematics and Physics, 6, 2553-2562. doi: 10.4236/jamp.2018.612213.