物流中心即時批次訂單的揀貨研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：52

、訪客IP：3.141.193.235

姓名

吳政潔(Jheng-Jie Wu) 查詢紙本館藏

畢業系所

工業管理研究所

論文名稱

物流中心即時批次訂單的揀貨研究
(A Study on the Real-Time Order-Batching Problem of Order-Picking in Distribution Centers)

相關論文

★ 佈置變更專案工程的執行研究－以H公司研發單位為例	★ MIL-STD-1916、MIL-STD-105E與結合製程能力指標之抽樣檢驗計畫
★ 建構客戶導向的製造品質資訊系統--以某筆記型電腦專業代工廠商為例	★ GMP藥廠設施佈置規劃的探討--以E公司為研究對象
★ 應用Fuzzy c-Means演算法之物流中心位址決策模式研究	★ 品質資訊系統之規劃與建構 -- 以某光碟製造公司為研究對象
★ 從製程特性的觀點探討生產過程中SPC管制圖監控運用的適切性 -- 以Wafer Level 封裝公司為例	★ 六標準差之應用個案研究-以光學薄膜包裝流程改善為例
★ 利用六標準差管理提昇中小企業之製程品質-以錦絲線添加防銹蠟改善為例	★ 專業半導體測試廠MES 系統導入狀況、成果及問題之探討-以A 公司為例
★ 以RFID技術為基礎進行安全管理導入－以A公司為例	★ 如何提昇產品品質及降低成本—以光碟壓片廠A公司為例
★ ERP導入專案個案分析—以半導體封裝廠A公司為例	★ 石英元件製造業之延遲策略應用— 以T公司為研究對象
★ 十二吋晶圓廠自動化搬運系統規劃與導入—以A公司為例	★ 半導體封裝產業之生產革新改善活動-A半導體股份有限公司導入經驗探討-

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

近年來由於網際網路的發達、消費型態的的轉變及世界經濟的全球化，使得物流的重要性大幅提升。然而物流業者為了能快速反應顧客多變的需求，期望能在正確的時點，運送正確數量與正確的商品到達客戶手中，所以傳統的物流模式已不再適用，必須有效地整合物流供應鏈，將傳統的多層級通路由「物流中心」取代，進而使物流中心成為一個極重要的角色。
在物流中心內的許多活動中，以「揀貨作業」是最耗費作業量與人力的一環，並且是與商品交期的準時、數量的正確性有最直接的關係。根據Coyle et al.(1996)的研究指出，揀貨作業占物流中心的總作業成本比例約達65%，是故，規劃一個合理的揀貨作業，對於物流中心的營運是有決定性的影響。
本研究欲探討的問題是物流中心的揀貨作業，其中將針對即時訂單批次的揀貨問題做探討，然而即時訂單批次所探討的因子包含：初始揀貨區選取(有4個水準)、配合揀貨區選取(有4個水準)、扣除品項選取(有2個水準)、批次訂單選取(有2個水準)，以及揀貨路徑(有2個水準)，共計有128種的實驗組合。吾人將藉由Visual C++ 8.0做模擬實驗，組合各不同因子的不同水準來進行實驗分析，並對系統模擬產生出的實驗數據以Excel 做輸出整理，最後以統計套裝軟體SPSS10.0 作一比較分析。以揀貨路徑距離為評估準則，期望得到一較佳的訂單批次組合方法，並對發展出之演算法作一結論，以及對未來研究方法的建議，以提供實體物流中心的揀貨作業有一參考依據。

摘要(英)

This study deals with the real-time order-batching problem in a warehouse. In real-time order-batching, two or more orders are combined together in one picking list, and composition of the picking list is affected by the picker visiting pick-up point. A designed methodology divides this problem into five sub-problems is proposed. The sub-problems are to orderly determine the initial picking-zone, the appendant picking-zone, the minus items, the select orders, and the picking route. The simulation experience is measured by the total travel distance. We want to understand not only the performance of every main factor but also their combined performance. Different random problems were generated and tested for this purpose. It is hoped that the knowledge learned from this study can provide substantial benefits to practitioners in distribution centers.

關鍵字(中)

★ 物流中心
★ 訂單批次揀取
★ 訂單切割

關鍵字(英)

★ Warehouse
★ Order batching
★ Order splitting

論文目次

目錄 III
圖目錄 V
表目錄 VII
第1章緒論 1
1-1 研究背景 1
1-2 研究動機 2
1-3 研究目的 2
1-4 研究環境 3
1-5 研究流程與架構 4
第2章文獻回顧 6
2-1 倉儲設計系統 (Warehouse design systems) 7
2-1-1 倉儲走道設計(Aisle design) 7
2-1-2 設施規劃(Layout planning) 9
2-2 倉儲規劃系統 (Warehouse planning systems) 11
2-2-1 儲存策略(Assignment strategy) 11
2-2-2 儲位指派(Storage assignment) 12
2-3 倉儲控制系統(Warehouse control systems) 15
2-3-1 訂單批次化(Order batching) 15
2-3-2 訂單切割(Order Splitting) 20
2-3-3 銷售員旅行問題(Traveling salesman problem; TSP) 21
2-3-4 揀貨政策(Picking policies) 23
第3章研究問題與方法 26
3-1 方法架構與流程 26
3-2 問題說明與假設條件 29
3-3 初始揀貨區選擇策略 31
3-3-1 隨機策略( Random；RD ) 32
3-3-2 最多揀取訂單策略( The Largest Number of Orders；LNO ) 32
3-3-3 最短距離策略( The Shortest Distance；SD ) 33
3-3-4 平均揀取數量最大策略( The Largerst Average Volume of Orders；LAVO ) 34
3-4 配合揀貨區選擇策略 34
3-4-1 隨機策略 ( RD ) 35
3-4-2 最短距離策略 ( SD ) 35
3-4-2-1 最多揀取數量策略( The Largest Volume；LV ) 36
3-4-2-2 最大相似度策略( The Largest Similarity；LS ) 37
3-4-3 墨汁擴散策略( IS ) 38
3-5 扣除品項策略 38
3-5-1 隨機策略( RD ) 39
3-5-2 最符合超量容積策略( The Fittest for Over-Capacity；FOC ) 39
3-6 選取批次訂單策略 40
3-6-1 隨機策略( Random；RD ) 41
3-6-2 優先性策略( Priority；PO ) 41
3-7 揀貨路徑規劃策略 42
3-7-1 最近鄰啟發式演算法(The Nearest Neighbor Heuristic；NNH) 43
3-7-2 模擬退火法(Simulated Annealing；SA) 44
3-8 釋例說明 45
第4章實驗結果與分析 52
4-1 模擬實驗設計 52
4-1-1 實驗環境 52
4-1-2 實驗目的與方法 53
4-1-3 模擬實驗因子 53
4-1-4 實驗項目說明 56
4-1-5 績效評估指標 56
4-2 模擬實驗結果 57
4-3 ANOVA統計分析檢定 58
4-3-1 基本假設檢定 58
4-3-2 變異數分析 59
4-3-3 主要效果項分析 63
4-3-4 交互作用分析 68
4-3-5 模擬退火法改善 81
4-4 實驗結論 83
第5章結論與建議 84
5-1 研究結論 84
5-2 未來研究與建議 85
參考文獻 86

參考文獻

1. Askin, R. G., and Standridge, C. R., 1993, “Modeling and Analysis of Manufacturing System”, John Wiley & Sons, New York.
2. Barrett, B. G., 1977, “A further digression on the over-automated warehouse: some evidence,” Interfaces, vol. 8, no.1, pp. 46-49.
3. Bassan Y., Roll Y., Rosenblatt M. J., 1980, “Internal Layout Design of a Warehouse”, AIIE Transactions, Vol.12, no.4, pp317-322.
4. Berg, J. P. V. D., and Zijm, W. H. M., 1999, “Models for warehouse management: Classification and examples, ” International Journal of Production Economics, vol. 59, no. 1-3, pp. 519-528.
5. BIANCHI Leonora , KNOWLES Joshua and BOWLER Neill, 2005,” Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms”, European journal of oper
6. Bozer, Y. A., 1986, “Optimizing throughput performance in designing order picking systems,” Ph.D. Dissertation, Georgia Institute of Technology, Atlanta, G.A.
7. Bozer, Y. A., Schorn, E. C., and Sharp, G. P., 1990, “Geometric Approaches to Solve the Chebyshev Traveling Salesman Problem,” IIE Transactions, vol. 22, no. 3, pp. 238-254.
8. Bramel, J., and Simchi-Levi, D., 1997, “The logic of logistics: theory, algorithms, and applications for logistics management,” Springer-Verlag, New York.
9. Brynzer, 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, issue. not
10. Brynzer. H. and Johansson. M. I, 1995, “Design and performance of kitting and order picking systems,” International Journal of Production Economics, vol. 41, no.1-3, pp.115-125.
11. Charles G. Petersen, Charles Siu, Daniel R. Heiser, 2005,“Improving order picking performance utilizing slotting and golden zone storage”, International Journal of Operations & Production Management,
12. Charles G. Petersen, Gerald Aase,2004,“A comparison of picking, storage, and routing policies in manual order picking”, International Journal of Production Economics, vol. 92,issue not defined,pp:11
13. Cormier, Gilles and Gunn, Eldon A., 1992, “A review of warehouse models,” European Journal of Operational Research, vol. 58, no.1, pp. 3-13
14. Elsayed, E. A., 1981, “Algorithms for optimal material handling in automatic warehouseing systems,” International Journal of Production Research, vol. 19, no. 5, pp. 525-535.
15. Elsayed, E. A., and Stern, R. G., 1983, “Computerized algorithms for order processing in automated warehousing systems,” International Journal of Production Research, vol. 21, no. 4, pp. 579-586.
16. Elsayed, E. A., and Unal, O. I., 1989, “Order batching algorithms and travel-time estimation for automated storage/retrieval systems,” International Journal of Production Research, vol. 27, no. 7, pp
17. Elsayed, E. A., Lee, M.-K., and Scherer, E., 1993, “Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals, ”International Journal of Production Researc
18. Eynan Amit and Meir J. Rosenblatt, 1994, “Establishing Zones In Single-Command Class-Based Rectangular AS/RS,” IIE Transactions, vol. 26, no.1, pp. 38-45.
19. Gademann, A. J. R. M., Jeroen, P. Van Den Berg, and Hassan, H. Van Der Hoff, 2001, “An order batching algorithm for wave picking in a parallel-aisle warehouse,” IIE Transactions, vol. 33, no. 5, pp.
20. Gibson, D. R., and Sharp, G. P., 1992, “Order batching procedures,” European Journal of Operational Research, vol. 58, no. 1, pp. 57-67
21. Goetschalckx, M., and Ratliff, H. D., 1988, “An efficient algorithm to cluster order picking items in a wide aisle,” Engineering Costs and Production Economics, vol. 13, no. 1, pp. 263-271.
22. Hall, R. W., 1993, “Distance approximations for routing manual pickers in a warehouse,” IIE Transactions, vol. 25, no. 4, pp. 76-87.
23. Hausman, W. H., Schwarz, L. B., and Graves, S. C., 1976, “Optimal storage assignment in automatic warehousing systems,” Management Science, vol.22,no.6, pp. 629-638.
24. Hwang, H., and Lee, M. K., 1988, “Order batching algorithms for a man-on-board automated storage and retrieval system,” Engineering Costs and Production Economics, vol. 13, no. 1, pp. 285-294.
25. Hwang, H., Bake, W., and Lee, M. K., 1988, “Clustering algorithms for order picking in an automated storage and retrieval systems,” International Journal of Production Research, vol. 26, no. 2, pp. 1
26. Hwang, H., Lee, Y. K., and Ko, C. S., 2001, “Routing policies in an order picking operation,” Proceeding of the 16th International Conference on Production Research.
27. IC Choi, SI Kim, HS Kim, 2003, ” A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem”, Computers and Operations Research,vol.30, issue 5, pp.773-786
28. J Privé, J Renaud, F Boctor and G Laporte,2006,” Solving a vehicle-routing problem arising in soft-drink distribution” Journal of the Operational Research Society, vol.57, issue 9, pp. 1045-1052
29. J. Won and S. Olafsson , Joint order batching and order picking in warehouse operations, International Journal of Production Research, vol. 43, no 7, pp. 1427 - 1442
30. Jarvis Jay M. and Edward D. McDowell, 1991, “Optimal Product Layout in an Order Picking Warehouse,” IIE Transactions, vol. 23, no. 1, pp. 93-102.
31. Jeong Han-Il; Jinwoo Park; R. C. Leachman, 1999, “A batch splitting method for a job shop scheduling problem in an MRP environment,” International Journal of Production Research, vol. 37, no. 15, pp.
32. Karasawa, Y., H. Nakayama, and S. Dohi, 1980, “Trade-off analysis for optimal design of automated warehouse,” International Journal of System Science, vol.11, no.5, pp.567-576
33. Kelle, P., and Miller, P. A., 2000, “Stockout risk and order splitting, ”International Journal of Production Economics, vol. 71, no. 1-3, pp. 407-415.
34. Koster, M. B. M. DE, Poort, E. S. VAN DER, and Wolters, M., 1999, ”Efficient orderbatching methods in warehouses,” International Journal of Production Research, vol. 37, no. 7, pp. 1479-1504.
35. Koster, R. D., and Poort, E. V. D., 1998, “Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions,” IIE Transactions, vol. 30, no. 5, pp. 469-480.
36. Larson T. Nick, Heather March and Andrew Kusiak, 1997, “A heuristic approach to warehouse layout with class-based storage,” IIE Transactions, vol. 29, no. 4, pp. 337-348.
37. Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R., and Shmoys, D. B., 1985, The traveling salesman problem: a guided tour of combinatorial optimization, John Wiley and Sons, New York.
38. Ling-feng Hsieh and Lihui Tsai,2006, “The optimum design of a warehouse system on order picking efficiency”, The International Journal of Advanced Manufacturing Technology,vol.28,no5-6,pp626-637
39. Liu, C. M., 1999, “Clustering techniques for stock location and order-picking in a distribution center,” Computers & Operations Research, vol. 26, no. 10~11, pp.989-1002.
40. Michael, C. Fu and Bharat K. Kaku, 1997, “Minimizing work-in-process and material handling in the facilities layout problem,” IIE Transactions, vol.29, no. 1, pp.29-36
41. N Christofides, 1975, Graph theory: An algorithmic approach, Academic Press, New York
42. Pan, C. H., and Liu, S. Y., 1995, “A comparative study of order batching algorithms,” Omega, vol. 23, no. 6, pp. 691-700.
43. Petersen II, C. G., and Schmenner, R. W., 1999, “An evaluation of routing and volume-based storage policies in an order picking operation,” Decision Sciences, vol. 30, no. 2, pp. 481-501.
44. Petersen, C. G., 1997, “An evaluation of order picking routeing policies, ”International Journal of Operations & Production Management, vol. 17, no. 11,pp. 1098-1111.
45. Ratliff, H. D., and Rosenthal, A. S., 1983, “Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem,” Operations Research, vol. 31, no. 3, pp. 507-521.
46. Roodbergen, K. J., and Koster, R. D., 2001b, “Routing order pickers in a warehouse with a middle aisle,” European Journal of Operational Research, vol.133, no. 1, pp. 32-43.
47. Roodbergen, K. J. and Koster, R. D., 2001a, “Routing methods for warehouses with multiple cross aisles,” International Journal of Production Research, vol. 39, no. 9, pp. 1865-1883
48. Rosenblatt, M. J. and A. Eynan, 1989, “Deriving the optimal bounders for class-based automatic storage/retrieval systems,” Management Science, vol. 35, no. 12, pp. 1519-1524.
49. Rosenwein, M. B., 1994, “An application of cluster analysis to the problem of locating items within a warehouse,” IIE Transactions, vol. 26, issue. 1, pp.101-103.
50. Rosenwein, M. B., 1996, “A comparison of heuristics for the problem of batching orders for warehouse selection,” International Journal of Production Research, vol. 34, no. 3, pp. 657-664.
51. Rouwenhorst, B., Reuter, B., Stockrahm, V., Houtum, G. J. V., Mantel, R. J., and Zijm, W. H. M., 2000, “Warehouse design and control: Framework and literature review,” European Journal of Operational
52. Vaughan T. S., and Petersen C. G., 1999, “The effect of warehouse cross aisles on order picking efficiency,” International Journal of Production Research, vol. 37, no. 4, pp. 881-897.
53. 王承新，2000，”遺傳基因演算法在物流中心儲位指派之應用”，元智大學工業工程研究所碩士論文。
54. 王麗慧,1999, “物流中心儲位指派與揀貨順序整合模式之研究”, 國立台灣科技大學工業管理研究所碩士學位論文。
55. 吳俊榮著，1998 年，啟發式訂單批次揀取方法之研究發展與績效評估，國立中正大學企業管理學系碩士學位論文。
56. 沈武賢，1999 ，「物流中心儲區通道佈置之規劃」，國立雲林科技大學工業工程與管理研究所碩士學位論文
57. 周士俊，2000， ”塔布搜尋法在物流中心人工揀貨區揀貨問題之研究”，元智大學工業工程研究所碩士論文
58. 孫海蛟、董福慶著，1995年， ”物流中心儲位管理”，經濟部商業司自動化系列叢書，台北。
59. 張壯營，1998，”塔布搜尋法在物流中心品項儲位指派問題之研究”，國立台灣科技大學工管所碩士學位論文。
60. 陳立穎，2001，“物流中心之人工揀貨區整體規劃與評估”，元智大學工業工程研究所碩士學位論文。
61. 曾裕茵著，200３年，「物流中心之訂單批次化與揀貨路徑問題探討」，國立中央大學工業管理研究所碩士學位論文。
62. 游志雄與黃志剛，1997，”運用遺傳基因演算法則規劃人工揀貨作業區之儲位”，中國工業工程學會八十六年度年會論文集第一冊，第341-346 頁。
63. 黃壬癸著，2001，”以揀貨量為基礎之倉儲儲位配置建構與評估”，國防管理學院後勤管理所碩士學位論文。
64. 簡美珍、陳振明，“物流中心揀貨作業最佳儲位規劃”，1996 國際商業物流管理研討會論文集，第330-338 頁。
65. 羅國書著，2001 年，「電子零售商的最佳化貨品揀取」，國立中央大學工業管理研究所碩士學位論文。
66. 蘇純增，1995，整合訂單揀取及批次處理之倉儲佈置設計，國立雲林技術學院學報，pp. 49-57
67. 蘇騰昇著，2002 年，「物流中心之最佳化揀貨策略」，國立中央大學工業管理研究所碩士學位論文。

指導教授

何應欽(Ying-Chin Ho)

審核日期

2007-7-6

推文