The Algorithms for Managing a Matrix-Based Warehouse Utilizing Standardized Transport and Storage Cells

Abstract

The article explores the principles of organizing warehouse systems based on standardized transport and storage cells. It discusses the general hardware features of transport and storage cells that enable the movement of stored goods between them. The article presents a method for constructing a warehouse graph that takes into account possible directions for transferring containers with cargo between the transport and storage cells integrated into the warehouse structure, along with their common hardware characteristics. Key criteria used in determining the edge weights of the graph are described, including the basic cost of movement for each axis, cell wear and tear, cargo weight, fragility of the cargo, distance to the nearest available cells, and repairability. Algorithms are presented, the primary task of which is to determine the sequence of container movements between warehouse cells to facilitate loading and unloading operations. Simulation modeling of a warehouse with dimensions of 5×5×5 was conducted using the proposed algorithms, both with and without considering cell wear and tear parameters. The results of the simulation highlighted the significance of this criterion, allowing for extended warehouse servicing intervals and maximizing the time until the first failure.The study also investigates the possibility of optimizing the structure of such warehouse systems to meet various requirements. As part of this investigation, the structure was optimized for a warehouse with dimensions of 4×3×3.