Storage Allocation Algorithm with Multi-Objective Optimization in High-Density Tridimensional Warehouse

Storage allocation in a high-density tridimensional warehouse has more constraints and optimization objectives than that in a single or dual rack warehouse. As a result, algorithms for storage allocation in this kind of warehouse must be different. This paper mapped the storage allocation problem to the knapsack problem (KP) and introduced a dynamic programming (DP) algorithm to solve the problem. A penalty score strategy was defined for the DP algorithm, and the optimization objective is to minimize the penalty score while satisfying the constraints. A multi-index strategy was used for preprocess according to the constraints, and this strategy also helped to reduce the scale of DP algorithm. Finally, the simulation showed that the time complexity of DP algorithm was greatly reduced compared with depth-first-search based recursive algorithm. While compared with particle swarm optimization (PSO), DP algorithm can run faster in actual projects problem scale, and more importantly, DP can get the optimal solution, not a suboptimal one.