Optimization of a Rectangular Warehouse Design Using Heuristics Techniques

This research aims to determine the number of cross aisles that minimizes distance traveled. To achieve this, a rectangular warehouse with various transverse aisles was defined, and simulations were conducted with 0 to 90 transverse aisles using heuristic algorithms (FCFS, G01, G02, G03, RANDOM, and SOP) for order batching, and S-Shape and L-Gap for order picking. The simulations considered a list of 20 to 100 orders or carts with a capacity of 30 to 75 order items. As a result, ANOVA analysis demonstrates the significance of order batching and picking algorithms, number of orders and cart capacity. The order batching algorithms that provide minimum distances in these experiments are G03 and RANDOM, and for order picking, LGAP algorithm is most effective. The number of cross aisles in configuration presented in this research that yields the minimum distances is 26; however, this is not conclusive to ensure that minimum distances will always be achieved with this number of transverse aisles.