A Heuristic Storage Location Assignment Based On Frequent Itemset Classes To Improve Order Picking Operations

Featured ApplicationThe storage location assignment problem (SLAP) attempts to determine the locations of items that minimize a distribution center's order picking times. This paper presents a data mining-augmented postprocessing heuristic to assign highly associated items to slots in proximity. Consequently, the proposed approach provides competitive storage layouts for distribution centers, which ultimately improves the efficiency of order pickers.Most large distribution centers' order picking processes are highly labor-intensive. Increasing the efficiency of order picking allows these facilities to move higher volumes of products. The application of data mining in distribution centers has the capability of generating efficiency improvements, mainly if these techniques are used to analyze the large amount of data generated by orders received by distribution centers and determine correlations in ordering patterns. This paper proposes a heuristic method to optimize the order picking distance based on frequent itemset grouping and nonuniform product weights. The proposed heuristic uses association rule mining (ARM) to create families of products based on the similarities between the stock keeping units (SKUs). SKUs with higher similarities are located near the rest of the members of the family. This heuristic is applied to a numerical case using data obtained from a real distribution center in the food retail industry. The experiment results show that data mining-driven developed layouts can reduce the traveling distance required to pick orders.