A Robust Storage Assignment Approach for Warehouse Management
碩士 === 國立臺北科技大學 === 資訊與運籌管理研究所 === 99 === The warehouse is an important part of supply chain. Among all the warehousing activities, order picking is estimated to account for 55% of the total operating costs. Therefore, storage assignment, a critical component of order picking, deserves serious atten...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/mbwg63 |
| Summary: | 碩士 === 國立臺北科技大學 === 資訊與運籌管理研究所 === 99 === The warehouse is an important part of supply chain. Among all the warehousing activities, order picking is estimated to account for 55% of the total operating costs. Therefore, storage assignment, a critical component of order picking, deserves serious attentions. In real applications, uncertainties on picking frequencies exist and complicate the order picking task. In this paper, we propose a robust storage assignment approach. And we propose an algorithm whose complexity is O(n^3) to calculate the maximum regret of the robust storage assignment problem. Finally, we propose a metaheuristic which combines iterated local search algorithm with greedy algorithm for the solutions. The solution algorithm guarantees near optimal performance even in the worst possible scenario.
|
|---|