Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm

• Published in: Mathematics
• Main Author: Nordin N.A.M.; Shariff S.S.R.; Supadi S.S.; Masudin I.
• Format: Article
• Language: English
• Published: Multidisciplinary Digital Publishing Institute (MDPI) 2024
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85203655616&doi=10.3390%2fmath12172698&partnerID=40&md5=a87be3c2150d9dedd11d39e7b93cf4d9

Order picking is referred as a critical process of selecting items requested by a customer in a warehouse. Meeting the demand of every customer is the main objective in this area. Large warehouses pose a challenge since the order-picking process is slowed considerably by the lengthy time it takes to transport items across the warehouse. Throughout the study, the system is hoped to develop proper procedures in the order-picking process. In handling this scenario, the decision-makers need to take any possible action to ensure the warehouses can keep operating and meeting the requirements and satisfaction of the customers. Due to this, the study’s main objective is to determine whether the Floyd–Warshall algorithm or the dynamic programming method will give the most accurate shortest path and minimum travel distance for order pickers. Two data sets (nine nodes and nineteen nodes) are used to determine the optimal path and minimum travel distance for the order picker to meet and satisfy customer orders for the warehouse. The two models were modified and applied to address real-world case studies from the automotive manufacturing company in Malaysia. The results show a big difference between the total distance by 113.48% for 19 nodes. Through this finding, the company may choose which method suits their preferences. Concurrently, this study may also contribute to problem-solving issues in any warehouse operation with a similar procedure. © 2024 by the authors.