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.

Highlights

  • Storage assignment strategy is a critical factor affecting warehouse operation efficiency

  • 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 section proposes a model for the scattered storage assignment problem based on association rules in Kiva mobile fulfillment system

Read more

Summary

Introduction

Storage assignment strategy is a critical factor affecting warehouse operation efficiency. Storage assignment strategy in Kiva mobile fulfillment system is still critical. Kiva mobile fulfillment system consists of inventory pods, robots, and workstations. After the items are picked up by workers in workstations, robots return the pods to the storage location. There are many operation problems in Kiva mobile fulfillment system, such as storage assignment problem, order batching problem, robot path planning problem, and pods selecting problem. Different from storage assignment problem in the traditional picker-to-parts warehouse, one item can be stored in multiple inventory bins in Kiva mobile fulfillment system, which is called scattered storage. The scattered storage assignment in Kiva mobile fulfillment system is one-to-many form while in the traditional picker-to-parts warehouse is one-to-one form. This article studied the scattered storage assignment problem based on association rules in Kiva mobile fulfillment system.

Literature Review
Problem Description
Integer Programming Model
Mining Association Rules
Genetic Algorithm
Crossover Operator
Comparison between Proposed Algorithm and CPLEX
Sensitivity Analysis
Findings
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.