物流中心之最佳化揀貨策略

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：23

、訪客IP：52.15.196.4

姓名

蘇騰昇(Teng-Sheng Su) 查詢紙本館藏

畢業系所

工業管理研究所

論文名稱

物流中心之最佳化揀貨策略
(Optimizing 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 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

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

摘要(中)

在這一波「電子商務」快速發展後，利用網路進行商業交易的活動日益明顯，顧客對於消費產品的需要，已經可以透過網路的便利性，隨時隨地取得所欲訂購的貨品，並且在國人對於生鮮貨品的衛生、安全、健康觀念之下，使這些日常生活主食品的購買方式，已經轉變為經由零售商的倉儲、運輸與配送的作業處理，加上時下便利商店已經快速成長，提供多項貨品宅配服務，都促使消費者對貨品能及時送達與新鮮性要求，有逐年增加之趨勢。
　　本研究將就貨品揀取時「揀貨箱pick and sort」、「訂單批次化處理」與「訂單分割」問題作探討，分為四個部份進行：首先決定在固定期間內揀取訂單（Order Pool），第二部份開始以四種種子訂單選取法則（RD隨機策略、LNVL最多揀取點策略、LNI最多品項策略、MRV最少剩餘揀貨箱容積策略），與四種配合訂單選取法則（MAD最少增加距離、MCVL最多共同揀取點、MCI最多共同品項、SNAA最少增加走道數）作訂單批次的搭配組合。第三部分為做揀取路徑的規劃，在第一階段利用三種啟發式演算法（LG最大間隙策略、NCRI最接近矩形中心插入、MTLI最短旅行迴圈插入）找到一個不錯的初始解，第二階段裡再利用模擬退火法（Simulated Annealing; SA）最佳化技術改善第一階段所得到的初解。第四部分是處理在第二部分訂單批次化會發生的訂單切割，以三種訂單切割選取法則（RD隨機策略、MDPD最近P/D距離、MIV最大品項容積）進行切割訂單。最後，本研究利用Visual Basic 6.0與Arena作模擬實驗，來評估不同揀貨路徑規劃下，種子訂單選取法則，搭配配合訂單選取法則與切割法則的各個實驗組合績效表現。除此之外，本研究是在既有的揀取問題上再作深入的探討，有其應用價值與實際性，期望在現今以網路購物的環境愈趨完整，提供未來其他研究的參考。

摘要(英)

Distribution centers have been playing an important role in delivering goods from manufacturers to the end users. The development of computer, information, and communication technologies has made everything go faster than it used to. For a distribution center, this means more frequent and faster delivery of goods to its customers. For years, industrial engineers have been looking for ways to optimize the order-picking operations in a distribution center. It has been shown by researchers that the cost of order picking comprises about 50% or more of the total operation cost of a distribution center (Hwang et al., 1988). And, it has been shown that a distribution center can boost its competitive advantages if its order-picking cost can be reduced （Ballou, 1992, Morabito et al., 2000）.
The purpose of this paper is to look for way to make the order-picking operations more efficient and effective. Problems investigated in this paper include order-batching problem, route-planning problem, and the order-splitting problem. For each problem, several solutions will be proposed. For order-batching problem, four seed-order selection algorithms (i.e., RD, LNVL, LNI, MRV) and four accompanying-order selection algorithms (i.e., MAD, MCVL, MCI, SNAA) will be proposed and investigated. They will make up 16 different combinations of seed-order selection algorithm and accompanying-order selection algorithm. As for the route-planning problem, four methods (i.e., NCGI, LG, NCRI, MTLI) will be investigated. The first method is obtained from Ho and Lo (2001), while the second one is called the largest-gap algorithm that was originally proposed by (Hall, 1993). And, the last two methods are proposed by us. It is a two-stage approach that finds an initial route first and then uses a heuristic optimization technique to improve the result. Finally, for the order-splitting problem, three algorithms (i.e., RD, MDPD, MIV) will be proposed and investigated. An order will be divided into two orders if its required space is greater than the remaining space in the picking cart.
To understand the performance of the above algorithms and methods, simulation experiments (using Arena) will be conducted. The simulation results not only can tell us which algorithm can perform better than others but also can help us understand their relationships. For example, one may see how one seed-order-selection algorithm is affected by another accompanying-order selection algorithm. It is our hope that the knowledge learned from this research can help us find the best solution for each of the above problems so that more effective and efficient order-picking operations can be obtained.

關鍵字(中)

★ 揀貨路徑規劃
★ 物流中心
★ 單元負荷
★ 訂單切割
★ 貨品揀取與處理
★ 種子與配合訂單選取
★ 訂單批次化

關鍵字(英)

★ order-batching
★ route planning
★ order-splitting
★ order-picking
★ distribution center

論文目次

論文摘要 i
目錄 ii
圖目錄 v
表目錄 vii
第一章緒綸 1
1.1 研究背景 1
1.2 研究動機 3
1.3 研究環境 4
1.4 研究目的 6
1.5 研究流程與架構 7
第二章文獻探討 9
2.1 物流活動 9
2.1.1 單元負荷 9
2.1.2 棧板負載 10
2.2 倉儲規劃 11
2.3 儲存指派策略 11
2.4 訂單揀貨問題 12
2.4.1 訂單批次化問題 12
2.4.2 訂單切割問題 15
2.5 揀貨路徑安排 16
2.5.1 走道佈置問題 16
2.5.2 揀貨政策 17
2.5.3 售員旅行者問題 19
第三章研究問題與方法 20
3.1 方法架構與流程 20
3.2 問題說明與假設條件 21
3.3 符號定義 24
3.4 種子訂單選取策略 26
3.4.1 隨機策略 28
3.4.2 最多揀取點策略 28
3.4.3 最多品項策略 28
3.4.4 最少剩餘揀貨箱容積策略 28
3.5 揀貨路徑規劃 29
3.5.1 最大間隙策略 29
3.5.2 最接近矩形中心啟發式 32
3.5.3 最短旅行迴圈插入啟發式 35
3.5.4 模擬退火法 39
3.6 配合訂單啟發式演算法 41
3.6.1 最少增加距離 43
3.6.2 最多共同揀取點 44
3.6.3 最多共同品項 44
3.6.4 最少增加走道數 45
3.7 訂單切割啟發式演算法 45
3.7.1 隨機策略 47
3.7.2 最近P/D距離 47
3.7.3 最大品項容積 47
3.8 釋例說明 47
第四章實驗結果與分析 56
4.1 模擬實驗設計 56
4.1.1 實驗環境 56
4.1.2 實驗目的與方法 57
4.1.3 模擬實驗因子 58
4.1.4 實驗項目說明 61
4.1.5 績效評估指標 61
4.2 模擬實驗結果 62
4.3 ANOVA統計檢定分析 69
4.3.1 基本假設檢定 69
4.3.2 變異數分析 70
4.3.3 交互作用分析 80
4.3.4 模擬退火法改善 87
4.4 實驗結論 90
第五章結論與建議 92
5.1 研究結論 92
5.2 未來研究建議 93
參考文獻 95
附錄A　Visual Basic模擬實驗操作 100
附錄B　Arena模擬實驗操作 105

參考文獻

Askin, R. G., and Standridge, C. R., 1993, Modeling and Analysis of Manufacturing System, John Wiley & Sons, New York.
Ballou, R. H., 1992, “Business Logistics Management,” Prentice-Hall, New York.
Bramel, J., and Simchi-Levi, D., 1997, “The logic of logistics: theory, algorithms, and applications for logistics management,” Springer-Verlag, New York.
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.
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.
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, pp. 595-603.
Chew, E. P., and Tang, L. C., 1999, “Travel time analysis for general item location assignment in a rectangular warehouse,” European Journal of Operational Research, vol. 112, no. 3, pp. 582-597.
Chiang, Chi, 2001, “Order splitting under periodic review inventory systems,” International Journal of Production Economics, vol. 70, no. 1, pp. 67-76.
Dowsland, W. B., 1995, “Improving palletisation efficiency the theoretical basis and practical application,” International Journal of Production Research, vol. 33, pp. 2213-2222.
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.
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. 1097-1114.
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 Research, vol. 31, no. 3, pp. 727-738.
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. 385-398.
Gibson, D. R., and Sharp, G. P., 1992, “Order batching procedures,” European Journal of Operational Research, vol. 58, no. 1, pp. 57-67.
Girish, M. K., and Hu, Jian-Qiang, 2000, “Higher order approximations for the single server queue with splitting, merging and feedback,” European Journal of Operational Research, vol. 124, no. 3, pp. 447-467.
Goetschalckx, M., and Ratliff, H. D., 1988a, “Order picking in an aisle,” IIE Transactions, vol. 20, no. 1, pp. 53-62.
Goetschalckx, M., and Ratliff, H. D., 1988b, “An efficient algorithm to cluster order picking items in a wide aisle,” Engineering Costs and Production Economics, vol. 13, no. 1, pp. 263-271.
Hall, R. W., 1993, “Distance approximations for routing manual pickers in a warehouse,” IIE Transactions, vol. 25, no. 4, pp. 76-87.
Hodgson, Thom J., 1982, “A Combined Approach to the Pallet Loading Problem,” IIE Transactions, 14(3), pp. 175-182.
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. 189-201.
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.
Hwang, H., Lee, Y. K., and Ko, C. S., 2001, “Routing policies in an order picking operation,” ICPR-16.
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. 3583-3598.
Johannes T., Guntram, S., Uta S., and Jan R., 2000, “An efficient approach for the multi-pallet loading problem,” European Journal of Operational Research, vol. 123, no. 2, pp. 372-381.
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.
Koster, M. B. M. DE, Pooft, 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.
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.
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, 1996.
Mason, Jessica O., and Girish N. Naik, 1991, “A Group Technology Approach for Container Size Selection,” Progress in Material Handling and Logistics, J. A. Wite and I. Pence, eds., Springer-Verlag, Heidelberg, Germany, pp. 57-66.
Morabito, R., Morales S. R., and Widmer, J. A., 2000, “Loading optimization of palletized products on trucks,” Transportation Research. Part e, Logistics & Transportation Review, vol. 36E, no. 4, pp. 285-296.
Pan, C. H., and Liu, S. Y., 1995, “A comparative study of order batching algorithms,” Omega, vol. 23, no. 6, pp. 691-700.
Petersen, C. G., 1997, “An evaluation of order picking routeing policies,” International Journal of Operations & Production Management, vol. 17, no. 11, pp. 1098-1111.
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.
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.
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.
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.
Rosenkrantz, D. J., Stearns, R. E., and Lewis II, P. M., 1977, “An analysis of several heuristics for the traveling salesman problem,” SIAM, vol. 6, pp. 563-581.
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. 6, pp. 657-664.
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 Research, vol. 122, no. 3, pp. 515-533.
Tsai, Russell D., Eric M. Malstrom, and Way Kuo, 1991, “A Three Dimensional Dynamic Palletizing Heuristic,” in Progress in Material Handling and Logistic, J. A. White and I. Pence, eds., Springer-Verlag, Heidelberg, Germany, pp. 181-204.
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.
Young-Gun, G, and Maing-Kyu, K., 2001, “A fast algorithm for two-dimensional pallet loading problems of large size,” European Journal of Operational Research, vol. 137, no. 1, pp. 193-202.
經濟部商業司　編，1995年，物流管理系列研討會論文集，經濟部商業自動化叢書，臺北市，經濟部商業司
吳俊榮著，1998年，啟發式訂單批次揀取方法之研究發展與績效評估，國立中正大學企業管理學系碩士學位論文。
邱振洋、吳琴玲　著，2000年，冷凍食品業物流中心資訊系統之規劃，商業現代化系列叢書4-物流中心資訊系統規劃，雲林縣，國立雲林科技大學商業自動化研究發展中心。
顏憶茹、張淳智　著，2001年，物流管理：原理、方法與實例，臺北縣，前程企管總經銷。
羅國書著，2001年，電子零售商的最佳化貨品揀取，國立中央大學工業管理研究所碩士學位論文。

指導教授

何應欽(Ying-Chin Ho)

審核日期

2002-7-10

推文