Determining the Shortest Path for Inner Warehouse Transportation

Always meeting customer needs is the primary goal of logistic service companies specializing in warehousing. However, warehouses are often large, and the movement of goods in the warehouse is problematic because it takes a long time and slows the order-picking process. This problem can be solved if storage assignment and the optimal warehouse movement route are appropriately planned. This study compares the use of Dynamic Programming models for two data in this warehouse in determining the shortest path for the Order Picker in completing and fulfilling customer orders. Keywords: Order picking, dynamic programming, inner warehouse transportation. eISSN 2514-7528 ©2023. The Authors. Published for AMER & cE-Bs by e-International Publishing House, Ltd., UK. This is an open-access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). Peer–review under the responsibility of AMER (Association of Malaysian Environment-Behaviour Researchers), and cE-Bs (Centre for Environment-Behaviour Studies, College of Built Environment, Universiti Teknologi MARA, Malaysia. DOI: https://doi.org/10.21834/jabs.v8i25.425