現在位置首頁 > 博碩士論文 > 詳目
  • 同意授權
論文中文名稱:旋轉料架儲位指派問題之研究 [以論文名稱查詢館藏系統]
論文英文名稱:Research of Carousel Storage Assignment Problem [以論文名稱查詢館藏系統]
院校名稱:臺北科技大學
學院名稱:管理學院
系所名稱:工業工程與管理研究所
出版年度:97
中文姓名:黃信哲
英文姓名:Shin-Jhe Huang
研究生學號:94378009
學位類別:碩士
語文別:中文
口試日期:2008-07-11
論文頁數:35
指導教授中文名:吳建文
指導教授英文名:Chien-Wen Wu
口試委員中文名:邱垂昱;杜壯
口試委員英文名:Chuei-yu Ciou;Jhuang Du
中文關鍵詞:旋轉料架儲位指派問題高頻項目集合探勘超圖形
英文關鍵詞:Carou0sel Storage AssignmentAssociation Rule MiningMinimum Spanning TreeOrgan Pipe Arrangement
論文中文摘要:本研究以吳建文教授在95年度國科會計畫中所提出之旋轉料架儲位指派方法進行研究分析,證實這種方法確實對於以旋轉料架為主之倉儲系統下的揀貨作業有所改善。這種旋轉料架儲位指派方法的最大特色在於結合了高頻項目集探勘與超圖形環狀排列技術的應用。目的在透過高頻項目集探勘找出交易資料庫中哪些品項經常一起出現在訂單中,再以超圖形的方式呈現多個品項經常一起出現於訂單的特性,最後,應用超圖形環狀排列的方法,找出環狀料架的最佳儲位指派方式。本研究以此旋轉料儲位指派方法與窮舉法暨實務上常見的儲位指派方法分別進行比較分析,茲就其儲位指派解與績效評量進行實驗,證明該旋轉料架儲位指派方式確實對於揀貨作業的進行有所改善。
論文英文摘要:This paper proves that the carousel storage assignment method suggested by Wu in 2006 provides good performance. The most important characteristic of this method is its integration of frequent itemsets mining and hypergraph circular arrangement. By frequent itemsets mining, it could discover the associations among the items in the order database. The discovered frequent itemsets are then represented as a hypergraph and the hypergraph circular arrangement technique is applied to find an assignment for the carousel storage. This research is to compare the suggested method with other methods, such as brute force search method and organ pipe arrangement policy. The result shows that the suggested method certainly provides good performance in both the computing time and the quality of solutions.
論文目次:目 錄
摘要 II
Abstract III
誌謝 IV
目 錄 V
圖目錄 VII
表目錄 VIII
第一章 緒論 1
1.1 研究動機與目的 1
1.2 研究目的 1
1.3 研究架構 2
第二章 文獻回顧 3
2.1 揀貨作業問題 3
2.2 儲位指派問題 4
2.2.1 假設品項之間毫無關聯性的相關文獻 6
2.2.2 僅探討至多兩個品項之間的關聯性的相關文獻 7
2.2.3 考量多個品項間之關聯性的相關文獻 8
2.3 結合高頻項目集探勘與超圖形環狀排列技術之儲位指派方法 9
2.3.1 高頻項目集探勘 10
2.3.2 超圖形環狀排列技術 12
第三章 研究方法 14
3.1 問題描述 14
3.2 研究步驟 15
3.2.2 求解旋轉料架儲位指派問題 17
3.2.3 揀貨訂單資料庫生成 18
3.2.4 模擬揀貨作業 19
3.3 研究範例 20
第四章 評估分析 23
4.1 與窮舉法之比較分析 24
4.2 模擬揀貨作業之研究分析 27
第五章 結 論 32
參考文獻 33
論文參考文獻:[1] A. Savasere, E. Omiecinski and S. Navathe, "An Efficient Algorithm for Mining Association Rules in Large Databases," in Proceedings of the 21st International Conference on Very Large Data Bases, Zurich, Switzerland, pp. 432-443, 1995.
[2] C. Berge, Graphs and Hypergraphs, New York: Elsevier, 1976.
[3] D. Burdick, M. Calimlim and J. Gehrke, "MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases," in Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, pp. 443-452, 2001.
[4] D. L. Van Oudheusden and W. Zhu, "Storage Layout of AS/RS Racks Based on Recurrent Orders," European Journal of Operational Research, vol. 58, pp. 48-56, 199.
[5] D. L. Van Oudheusden, Y. J. Tzen and H. Ko, "Improving Storage and Order Picking in A Person-on-Board AS/RS System," Engineering Costs and Production Economics, vol. 13, pp. 273-283, 1988.
[6] E. A. Frazelle and G. P. Sharp, "Correlated Assignment Strategy Can Improve Any Order-Picking Operation," Industrial Engineering, vol. 21, pp. 33-37, 1989.
[7] E. Cohen., M. Datar et. al, , "Finding Interesting Associations without Support Pruning," in ICDE, 2000.
[8] E. Hassini and R. G. Vickson, "A Two-Carousel Storage Location Problem," Computers &Operations Research, vol. 30, pp. 527-539, 2003.
[9] H. Brynzer and M. I. Johansson, "Storage Location Assignment: Using the Product Structure to Reduce Order Picking Times," International Journal of Production Economics, vol. 46, pp. 595-603, 1996.
[10] http://www.borgelt.net/index.html
[11] J. Ashayeri and M. Goetschalckx, "Analysis and Design of Order Pick Systems," in 9th International Conference on Automation in Warehousing, pp. 125-135, 1988.
[12] J. J. Coyle, E. J. Bardi and C. J. Langley, The Management of Business Logistics, 6th ed., West Publishing, St Paul, MN, 1996.
[13] J. P. Van den Berg, "A Literature Survey on Planning and Control of Warehousing Systems," 31, vol. 31, pp. 751-762, 1999.
[14] K. Gouda and M. J. Zaki, "Efficiently Mining Maximal Frequent Itemsets", in Proceedings of IEEE International Conference on Data Mining, San Jose, USA, pp. 163-70, 2001.
[15] K. A. Ravindra, L. M. Thomas and James B. O., Network Flows NJ: Prentice Hall Inc., Englewood Cliffs, 1993.
[16] K. Wang, Y. He, D. W. L. Cheung and F. Y. L. Chin, "Mining Confident Rules without Support Requirement," in ACM CIKM, 2001.
[17] Microsoft Developer Network (http://msdn.microsoft.com/en-us/default.aspx)
[18] Q. Zou, W. W. Chu and B. Lu, "Smart Miner: A Depth First Algorithm Guided by Tailinformation for Mining Maximal Frequent Itemsets," In: Proceedings of IEEE International Conference on Data Mining, Maebashi City, Japan, pp. 570-579, 2002.
[19] R. Agrawal and R. Srikant "Fast Algorithms for Mining Association Rules," in Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, pp. 487-499, 1994.
[20] R. C. Agarwal, C. C. Aggarwal and V. V. V. Parsad, "A Tree Projection Algorithm for Generation of Frequent Itemsets," Journal of Parallel and Distributed Computing, 61(3), pp. 350-361. 2001.
[21] R. G. Vickson and A. Fujimoto, "Optimal Storage Locations in a Carousel Storage and Retrieval System," Location Science, vol. 4, pp. 237-245, 1996.
[22] R. G. Vickson and X. J. Lu, "Optimal Product and Server locations in One-Dimensional Storage Racks," European Journal of Operational Research, vol. 105, pp. 18-28, 1998.
[23] S. W. Changchien and T. C. Lu "Mining Association Rules Procedure to Support On-Line Recommendations by Customers and Products fragmentation," Expert Systems with Application, vol. 20, pp. 325-335, 2001,.
[24] S.Sahni and T.Gonzalez, "P-Complete Approximation Problems," J. Assoc. Comput. Mach., vol. 23, pp556-565, 1976.
[25] V. E. Liberatore, "Multicast Scheduling for List Requests," in Proc. IEEE INFOCOM'02, pp. 1129-1137, 2002.
[26] W. H. Hausman, L. B. Schwarz, and S. C. Graves, "Optimal Storage Assignment in Automatic Warehousing Systems," Management Science, vol. 22, pp. 629-638, 1976.
[27] 吳建文, "國科會計畫規劃書 - 結合高頻項目集探勘和超圖形直線與環狀排列方法在倉儲儲位指派問題之應用", 95。
論文全文使用權限:同意授權於2010-07-30起公開