Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工業工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/20961
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor吳政鴻(Cheng-Hung Wu)
dc.contributor.authorYa-Hua Huangen
dc.contributor.author黃婭華zh_TW
dc.date.accessioned2021-06-08T03:12:36Z-
dc.date.copyright2017-02-20
dc.date.issued2016
dc.date.submitted2017-02-15
dc.identifier.citationBorgelt, C. (2003). Efficient Implementations of Apriori and Eclat. Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL). CEUR Workshop Proceedings 90.
Caron, F., Marchet, G., & Perego, A. (2000). Layout design in manual picking systems: a simulation approach. Integrated Manufacturing Systems, 11(2), 94-104.
Chuang, Y.-F., Lee, H.-T., & Lai, Y.-C. (2012). Item-associated cluster assignment model on storage allocation problems. Computers & Industrial Engineering, 63(4), 1171-1177.
de Koster, R., Le-Duc, T., & Roodbergen, K. J. (2007). Design and control of warehouse order picking: A literature review. European Journal of Operational Research, 182(2), 481-501.
Han, J., & Kamber, M. (2000). Data Mining: Concepts and Techniques, 13-16.
Koster, K. J. R. R. d. (2001a). Routing methods for warehouses with multiple cross aisles. International Journal of Production Research, 39(9), 1865-1883.
Koster, K. J. R. R. d. (2001b). Routing order pickers in a warehouse with a middle ailse. European Journal of Operational Research, 133(32-43).
Ming-Huang Chiang, D., Lin, C.-P., & Chen, M.-C. (2014). Data mining based storage assignment heuristics for travel distance reduction. Expert Systems, 31(1), 81-90.
Muppanimuppant, V., & Adil, G. (2008). Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach☆. Omega, 36(4), 609-618.
Oudheusden, D. L. v., & Zhu, W. (1992). Storage layout of AS/RS racks based on recurrent orders. European Journal of Operational Research, 58, 48-56.
Ratliff H. D., & Rosenthal S. (1983). Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Proble. Operations Research, 31(3), 507-521.
Srikant, R. A. R. (1994). Fast Algorithms for Mining Association Rules. the 20th VLDB Conference Santiago, Chile.
Swami, R. A. T. I. A. (1993). Mining Association Rules between Sets of Items in Large Databases. ACM SIGMOD Conference Washington DC, USA.
Tompkins, J.A., White, J.A., Bozer, Y.A., Frazelle, E.H., & Tanchoco, J.M.A. (2003). Facilities Planning. John Wiley &Sons, NJ.
Zak, M. J., S.Parthasarathy, Ogihara, M., & Li, W. (1997). New Algorithms for Fast Discovery of Association Rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining, 283-286.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/20961-
dc.description.abstract本研究發展智慧儲位指派模型,把品項相關性納入考量。品項相關性是指消費者訂單中品項與品項之間的關聯度,當不同的品項多次同時出現在消費者的訂單中時,品項與品項之間就形成了較高的相關性;當不同的品項幾乎從來沒有同時出現在消費者的訂單中時,品項與品項的相關性就很低。品項的相關性源於消費者的消費形態,消費者少量多樣的消費形態導致其訂單揀貨耗時長,已成為企業提高顧客服務品質的阻礙。影響揀貨作業的因素之一為倉儲系統品項之儲位指派。傳統的儲位指派較多依靠ABC存貨管理法則或是倉儲管理者之主觀經驗,較少將品項之間的關係納入考量。本研究將以總訂單揀貨成本最小化為目標,由關聯法則獲取品項之間的關聯性,再發展智慧儲位指派模型,使其能成為優於EIQ方法的新的儲位指派方法,大幅度縮短總訂單揀貨成本。zh_TW
dc.description.abstractThis study develops Intelligent Storage Location Assignment (ISLA) algorithm in consideration of correlation between items to minimize order picking costs. The correlation between items is defined by the frequency of simultaneous appearance of items in customers’ orders. When high correlation items were allocated remotely in the warehouse, order picking costs will increase. Hence items with high correlation should be allocated in nearby storage locations to reduce order picking costs. Traditionally, Storage Location Assignment Problem (SLAP) is mainly solved by the subjective experience of warehouse manager or class-based storage policy; little research considers the relationship between items. In the proposed ISLA algorithm, a benefit function is developed to evaluate the fitness of storage location. To evaluate the performance of ISLA, a real-world dataset is used to compare order picking costs under different storage location assignment algorithms. Our results show that the proposed ISLA algorithm regularly outperforms other methods. When used in a multiple-cross-aisle warehouse, the proposed ISLA can reduce picking costs by up to 4.02%.en
dc.description.provenanceMade available in DSpace on 2021-06-08T03:12:36Z (GMT). No. of bitstreams: 1
ntu-105-R03546036-1.pdf: 1071041 bytes, checksum: 2cefc68180bededf2795b6845b897f8c (MD5)
Previous issue date: 2016
en
dc.description.tableofcontents誌謝 I
中文摘要 II
ABSTRACT III
目錄 IV
圖目錄 VI
表目錄 VII
第一章 緒論 1
1.1 研究問題背景 1
1.2 研究動機與目的 4
1.3 研究方法與流程 4
第二章 文獻回顧 7
2.1 關聯法則相關議題研究 7
2.2 倉儲佈局之相關文獻 8
2.3 儲位指派之相關文獻 8
2.4 小結 11
第三章 問題描述與模型建構 12
3.1 研究用語定義 12
3.2 問題架構與相關假設 12
3.3 問題模式之參數定義 14
3.4 RAUDH儲位坐標定義 16
3.5 儲位之間最短距離 17
3.5.1 兩儲位處於不同的排區域 17
3.5.2 兩儲位處於相同的排區域 18
3.6 儲位至I/O點的距離 22
3.7 品項相關性定義 23
3.8 品項訂購頻率定義 23
3.9 揀貨路徑計算 23
3.10 R-A區域初始儲位指派 24
3.11 儲位交換法則 26
3.11.1 R-A區域與區域之間交換 26
3.11.2 R-A區域內部交換 29
3.12 智慧儲位指派之流程圖 31
第四章 數值範例與實驗分析 33
4.1 程式系統介面設計與流程 33
4.1.1 系統介面設計說明 33
4.1.2 系統使用流程說明 34
4.2 數值範例 35
4.2.1 範例參數設定 35
4.2.2 範例求解結果 37
4.2.3 成本項敏感度分析 38
4.3 不同倉儲佈局之影響 40
4.4 不同倉庫尺寸之影響 42
4.5 實驗結果驗證 44
第五章 結論與未來研究方向 46
5.1 結論 46
5.2 未來研究方向 46
參考文獻 48
dc.language.isozh-TW
dc.subject訂單揀貨成本zh_TW
dc.subject品項相關性zh_TW
dc.subject揀貨作業zh_TW
dc.subject智慧儲位指派zh_TW
dc.subjectCorrelation between Itemsen
dc.subjectStorage Location Assignment Problemen
dc.subjectIntelligent Storage Location Assignmenten
dc.subjectOrder Picking Costsen
dc.title考量品項相關性之智慧儲位指派zh_TW
dc.titleIntelligent Storage Location Assignment in Consideration of Correlation between Itemsen
dc.typeThesis
dc.date.schoolyear105-2
dc.description.degree碩士
dc.contributor.oralexamcommittee喻奉天(Vincent Yu),洪一薰,羅惠瓊(Hui-Chiung Lo)
dc.subject.keyword品項相關性,揀貨作業,智慧儲位指派,訂單揀貨成本,zh_TW
dc.subject.keywordCorrelation between Items,Order Picking Costs,Intelligent Storage Location Assignment,Storage Location Assignment Problem,en
dc.relation.page49
dc.identifier.doi10.6342/NTU201700646
dc.rights.note未授權
dc.date.accepted2017-02-16
dc.contributor.author-college工學院zh_TW
dc.contributor.author-dept工業工程學研究所zh_TW
顯示於系所單位:工業工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-105-1.pdf
  未授權公開取用
1.05 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved