Genetic Algorithm for Scattered Storage Assignment in Kiva Mobile Fulfillment System

HTML  XML Download Download as PDF (Size: 808KB)  PP. 474-485  
DOI: 10.4236/ajor.2018.86027    1,234 Downloads   2,807 Views  Citations

ABSTRACT

Scattered storage means an item can be stored in multiple inventory bins. The scattered storage assignment problem based on association rules in Kiva mobile fulfillment system is investigated, which aims to decide the pods for each item to put on so as to minimize the number of pods to be moved when picking a batch of orders. This problem is formulated into an integer programming model. A genetic algorithm is developed to solve the large-sized problems. Computational experiments and comparison between the scattered storage strategy and random storage strategy are conducted to evaluate the performance of the model and algorithm.

Share and Cite:

Guan, M. and Li, Z. (2018) Genetic Algorithm for Scattered Storage Assignment in Kiva Mobile Fulfillment System. American Journal of Operations Research, 8, 474-485. doi: 10.4236/ajor.2018.86027.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.