Slotting Optimization of Warehousing System Based on the Hungarian Method

This paper studies the problem of storage space optimization system based on different demand frequencies and different demand quantities. An 0–1 integer programming model is established aimed at minimizing the objective of total routing with the weight of turnover rate of the goods, based on the principle that something commonly used should be easy to take. Combining the idea of Hungarian method, the objective function and constraints are transformed, and then the problem is solved by Hungarian methods, which has been proved to get optimal solution. Finally, a data test is provided to illustrate the effectiveness of the problem. This study can provide theoretical and technical support for warehousing slotting optimization system.