Comparison of Dijkstra’s algorithm and dynamic programming method in finding shortest path for order picker in a warehouse

• Main Authors: Nordin, Noraimi Azlin Mohd, Omar, Mohd, Sharif, S. Sarifah Radiah
• Format: Conference Proceeding
• Language: English
• Subjects: Algorithms; Distribution centers; Dynamic programming; Operating costs; Order picking; Productivity; Response time; Shortest-path problems; Warehouses
• ISSN: 0094-243X; 1551-7616
• DOI: 10.1063/1.4980887

Companies are looking forward to improve their productivity within their warehouse operations and distribution centres. In a typical warehouse operation, order picking contributes more than half percentage of the operating costs. Order picking is a benchmark in measuring the performance and productivity improvement of any warehouse management. Solving order picking problem is crucial in reducing response time and waiting time of a customer in receiving his demands. To reduce the response time, proper routing for picking orders is vital. Moreover, in production line, it is vital to always make sure the supplies arrive on time. Hence, a sample routing network will be applied on EP Manufacturing Berhad (EPMB) as a case study. The Dijkstra’s algorithm and Dynamic Programming method are applied to find the shortest distance for an order picker in order picking. The results show that the Dynamic programming method is a simple yet competent approach in finding the shortest distance to pick an order that is applicable in a warehouse within a short time period.