The Application of Dynamic Programming Method in Finding Shortest Path for Order Picker with Limited Picking Capacity

• 발행기관: KINFORMS
• 저자명: Noraimi Azlin Mohd Nordin Mohd Omar S. Sarifah Radiah Shariff
• 간행물 정보: 『Management Review: An International Journal』Vol.13 No.1, 20~48쪽, 전체 29쪽
• 주제분류: 사회과학 > 사회과학일반
• 파일형태: PDF
• 발행일자: 2018.06.30

영문 초록

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. Smooth and fast order picking can help to reduce waiting time at the customers end and may increase customers’ satisfaction. Hence, it is crucial to reduce order picking time and one of the ways is by considering the proper routing for picking an order in the warehouse. In this study, the Dynamic Programming (DP) method and Dijkstra’s algorithm are applied to find the shortest distance for order picking in an automotive manufacturing company’s warehouse. The results show that the DP method is a simple yet competent approach compared to Dijkstra’s algorithm in finding the shortest distance to pick an order. DP is then adopted to determine the shortest distance for each order picker considering the limited volume he can picked at a time The results show a reduced of shortest time by 12% using this method. The shortest distance for each OP with items are also discussed thoroughly in this paper.

목차

INTRODUCTION

METHODOLOGY

STUDY SETTING

RESULTS AND DISCUSSION

CONCLUSION

ACKNOWLEDGEMENT

REFERENCES

키워드

Shortest path model Order picker Warehouse cost management