Developed and implemented a storage location assignment for a warehouse
We successfully developed and implemented a storage location assignment method that aimed to reduce travel time and delay caused by traffic congestion for order pickers in the warehouse. Through the use of a multi-objective mathematical model, we were able to identify highly correlated items and place them closer to the dock, thus reducing travel time for order pickers and addressing the issue of traffic congestion. To solve the non-deterministic polynomial-time hard (NP-hard) storage location assignment problem, we utilized Multi-Objective Evolutionary Algorithms NSGA-II and SPEA 2 to create clusters. We then used the SKU Assignment Algorithm to assign SKUs to storage locations based on the model. The results of the final generations were analyzed, and we selected five solutions using K-means clustering to compare the results obtained from NSGA-II and SPEA 2 Algorithms with the random storage method. Furthermore, we conducted a simulation study to assess the impact of traffic congestion under different scenarios.
