Open AccessSensitivity Analysis in Finding Shortest Path for Order Picker with Limited Picking Capacity
Author(s) -
Noraimi Azlin Mohd Nordin,
S. Sarifah Radiah Shariff,
Mohd Omar
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1496/1/012021
Subject(s) - order picking , warehouse , order (exchange) , shortest path problem , process (computing) , routing (electronic design automation) , computer science , path (computing) , variable (mathematics) , sensitivity (control systems) , dynamic programming , set (abstract data type) , operations research , mathematical optimization , engineering , mathematics , algorithm , economics , business , marketing , computer network , graph , mathematical analysis , finance , theoretical computer science , electronic engineering , programming language , operating system
The success of any warehouse management is normally contributed by the success of order picking process. In any warehouse operation, order picking contributes more than half percentage of the total warehouse operating costs. Layout of warehouse, storage allocation, number of order pickers and various routing methods contribute to significant impact on the order picking process. All of these variables need to be considered in ensuring smooth and fast order picking process. We test the variation of each variable in finding the optimal route for each order picker, using a modified Dynamic Programming method. Real data set of a warehouse operation is used for the study. The results show a reduced of total distance by 11.6% by choosing the shortest path based on the number of order pickers and an increase by 48% using batch picking method. The shortest distances for each OP with limited capacity are also discussed thoroughly in this paper.