Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse

摘要

In a warehouse, if we can identify a small subset of items that can satisfy a large percentage of orders, we can improve the warehousing performance by assigning the small subset of items to a highly automated order completion zone. Current approach to identify such a small subset of items is heuristic based and does not guarantee a good solution. In this paper, we propose a novel approach to identify all the small subsets of items that can satisfy a large percentage of orders. We show that, with simple transformations, we can use the existing frequent itemset mining software or algorithm to solve the problem. Our approach has all the advantages provided by frequent itemset mining, including the capability of considering associations among items and the capability of handling a large order database. Our approach can be implemented with little effort by using existing frequent itemset mining software or algorithm. Furthermore, our approach guarantees all the desired solutions and allows the decision maker the fullest flexibility to plan the warehouse. Experiments on an order database of a real warehouse were performed to demonstrate the effectiveness of this approach. The experimental results show that our approach outperforms the existing approach.