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

Noraimi Azlin Mohd Nordin, S. Sarifah Radiah Shariff (), Siti Suzlin Supadi and Ilyas Masudin
Additional contact information
Noraimi Azlin Mohd Nordin: School of Mathematical Sciences, College of Computing, Informatic and Mathematics, Universiti Teknologi MARA, Cawangan Negeri Sembilan, Kampus Seremban, Seremban 70300, Malaysia
S. Sarifah Radiah Shariff: Malaysia Institute of Transport (MITRANS), Universiti Teknologi MARA, Shah Alam 40450, Malaysia
Siti Suzlin Supadi: Institute of Mathematical Sciences, Faculty of Science, Universiti Malaya, Kuala Lumpur 50603, Malaysia
Ilyas Masudin: Industrial Engineering, University of Muhammadiyah Malang, Jl. Raya Tlogomas 246, Malang 65144, Indonesia

Mathematics, 2024, vol. 12, issue 17, 1-19

Abstract: 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.

Keywords: order picking; order picker; dynamic programming; Floyd–Warshall algorithm; inner warehouse transportation (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/17/2698/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/17/2698/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:17:p:2698-:d:1467224

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().