倉儲系統使用叢集分析解決訂單批次化和批次順序問題

簡易檢索 / 詳目顯示

回結果列表

研究生：	郝偉正 Wei-cheng Hao
論文名稱：	倉儲系統使用叢集分析解決訂單批次化和批次順序問題 A order batching and sequence of batches problem in a warehouse system using clustering analysis
指導教授：	潘昭賢 Chao-Hsien Pan
口試委員:	歐陽超 Ou-Yang Chao 許總欣 Tsung-Shin Hsu
學位類別：	碩士 Master
系所名稱：	管理學院 - 工業管理系 Department of Industrial Management
論文出版年：	2006
畢業學年度：	94
語文別：	英文
論文頁數：	37
中文關鍵詞：	倉儲管理、多揀貨員、物流中心、訂單批次化
外文關鍵詞：	order batching, warehouse management, multiple picker operations, Distribution centers
相關次數：	點閱：193 下載：2
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

本研究探討在物流中使用叢集分析建構訂單批次化的問題。對於提昇倉儲管理的效率而言，揀貨作業是最重要的關鍵因素。過去對於揀貨作業的研究，大都只考量到單一揀貨員；但在實際的倉儲系統中，通常都會有多個揀貨員同時在同一區域內進行作業。這種多人作業的倉儲系統，有可能會發生阻塞的情況，所以僅使用行走時間或距離無法評估揀貨的績效，必需加入人員的等候時間，才能反映整體作業的效率。在例行的揀取大量的訂單之前，有效的將訂單批次化可以加速產品的流動•在此我們發展一個訂單批次及順序啟發法來處理通道阻塞以最小化行走距離或時間•本研究模擬並發展倉儲模式，以執行啟發式定單批次化法則，並進行模擬測試。比較所提出啟發式法則的績效，而結果顯示啟發式法則的確優於傳統訂單批次化法則。

This paper considers the problem of constructing order batches for distribution centers using a clustering analysis. Order picking is one of the most important key factors for an efficient warehouse management. Most of previous research in order picking considered only single-picker operation; however, there are often multiple pickers concurrently working at the same region in a real distribution center. Since congestion may occur in such a multiple picker system, waiting time must be taken into account together with travel time or travel distance in the evaluation of the efficiency for the picking operations.
Order picking is routine in distribution centers. Before picking a large set of orders, effectively grouping orders into batches can accelerate product movement with the storage zone. The literature has proposed a order batching and processing heuristic to address aisle congestion for minimizing travel distance or travel time. The purpose of this research is to study the effect of congestion on the order picking operations in a multiple picker distribution center with a parallel-aisle layout.
This paper compares the total travel time for different order batching algorithm. A simulation model is proposed and developed to implement these various heuristic. The results show that the proposed order batching heuristic outperform the existing traditional order batching algorithm in a multiple picker warehouse environment.

CONTENTS
摘要.........................................................................I
ABSTRACT.....................................................................II
ACKNOWLEDGEMENTS............................................................III
CONTENTS.....................................................................IV
TABLE INDEX..................................................................V
FIGURE INDEX.................................................................VI
CHAPTER 1  INTRODUCTION......................................................1
CHAPTER 2  LITERATURE REVIEW.................................................4
CHAPTER 3  RESESRCH METHODOLOGY..............................................7
3.1  The Warehouse Model...................................................7
3.1.1 Operational Assumptions............................................7
3.1.2 Waregouse Dimension and Structure..................................8
3.2  Order Batching Strategy...............................................9
3.2.1 The Batch Construction Heuristics..................................9
3.2.2 Sequence of batches................................................11
3.3Notation............................................................14
3.4The Group Tenchonlogy Order Batching Release Sequence Heuristic....15
CHAPTER 4  EXPERIMENTAL DESIGN AND SIMULATION MODEL..........................20
4.1  The Description of the Simulation Model...............................20
4.1.1 SKU Demand Patterns................................................20
4.1.2 The Storage Assignment Strategy....................................20
4.1.3 Picking Parmaeters.................................................21
4.1.4 Order Batching, Sequencing, and Routing............................21
4.2  Experimental Design...................................................22
4.3  Test Problems.........................................................23
4.4  Computation Result....................................................24
4.5  Sensitivity Analyses..................................................29
CHAPTER 5  CONCLUSIONS.......................................................34
REFERENCES...................................................................36

                                

REFERENCES
[1]Coyle, J. J., Bardi, E. J., Langley, C. J., (1999). The management of business logistics, sixth ed. West Publishing Company, Minneapolis.
[2]Ackerman, K. B. (1990). Practical handbook of warehouse. VanNorstrand Reinhold, New York.
[3]Van Dijkizen, G. and Van Harten, A., (1997). Optimal clustering of frequency-constrained maintenance jobs with shared set-ups. European Journal of Operational Research., 99(3), 552-564.
[4]Bynzer, H., and Johansson, M. I., (1996) “Storage location assignment: using the product structure to reduce order picking times,” International Journal of Production Economics, Vol. 46-47, , p595-603.
[5]Petersen. C. G., Aase. C., (2004). A comparison of picking, storage, and routing policies in manual order picking. Int. J. Production Economics, 92, p11-19.
[6]Choe. H., (1991). Aisle-based order pick systems with batching, zoning and sorting. PH. D Thesis, Georgia Institute of Technology, Atlanta.
[7]Elsayed EA, Unal IO. (1989). Order batching algorithms and travel time estimation for automated storage/retrieval systems. International Journal of Production Research, 27(7): p1097-1113.
[8]Elasyed EA, Stern RG. (1983). Computerized algorithm for ordering in automated warehousing systems. International Journal of Production Research, 21(4): p579-586.
[9]Bartholdi, J. J., and Platzman, L. K, (1988), Heuristics based on spacefilling curves fir combinatorial problems in euclidean space, Management Science, 1(4), p121-125.
[10]Gibon, D. R., G. P. Sharp. (1992). Order batching procedures. European Journal of Operational Research, 58, p57-67.
[11]Frazelle, E. H. (1989) Stock location assignment and order picking productivity. Unpublished Doctoral Dissertation, Georgia Institute of Technology, Atlanta, GA
[12]Vinod, H. D., (1969), “Integer Programming and the Theory of Grouping”, Journal of the American Statistical Association.
[13]Kusiak, A., Vanelli, A., and Kumar, K. R. (1986), “Clustering analysis Models and algorithms”, Control and Cybernetics.
[14]Van Dijkhuizen, G. and Van Harten, A., (1996) Operational clustering of frequency-constrained maintenance jobs with shared set-ups. European Journal of Operational Research., 34, p657-664.
[15]Nair, G. J. and Narendran, T. T., (1998) CASE: a clustering algorithm for cell formation with sequence date. International Journal of Production Research., 36(1), p157-179.
[16]Birgin, E. G., Martnez, J. M. and Ronconi, D. P., (1998) Minimization subproblems and heuristics for an applied clustering problem. European Journal of Operational Research., 146(1), p19-34.
[17]Yoon, C. S., and G. P. Sharp, (1996). A structured procedure for analysis and design of order picking systems. IIE Transactions. 28 379-389.
[18]Ballou, R. H. (1985). Business Logistics Management, 2nd. ed. Prentice Hall, Englewood Cliffs, NJ.
[19]Petersen, C. G., (2000). An evaluation of order picking policies for mail order companies. Production and Operations Management, 9(4), p319-335.
[20]Gray, AE., Karmarkar, U. S., Seidmann, A., (1992). Design and Operation of an order-consolidation warehouse: Models and application. European Journal of Operational Research, 58, p3-13.

全文公開日期 2009/06/12 (校內網路)
全文公開日期本全文未授權公開 (校外網路)
全文公開日期本全文未授權公開 (國家圖書館：臺灣博碩士論文系統)

簡易檢索 / 詳目顯示

相關論文