跳到主要內容

臺灣博碩士論文加值系統

(18.97.14.91) 您好!臺灣時間:2025/02/11 20:10
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:陳治齊
研究生(外文):CHEN,CHIH-CHI
論文名稱:以Connector為基建構綠色設計之拆裝規劃
論文名稱(外文):Green-oriented disassembly planning design based on the connector concept
指導教授:曾懷恩曾懷恩引用關係
指導教授(外文):TSENG,HWAI-EN
口試委員:黃敬仁張育仁
口試委員(外文):HUANG,CHING-JENCHANG,YU-JEN
口試日期:2019-06-24
學位類別:碩士
校院名稱:國立勤益科技大學
系所名稱:工業工程與管理系
學門:工程學門
學類:工業工程學類
論文種類:學術論文
論文出版年:2019
畢業學年度:107
語文別:中文
論文頁數:63
中文關鍵詞:綠色設計ConnectorFAST功能分析系統釋放圖貪婪演算法
外文關鍵詞:Green DesignConnectorFASTReleased DiagramGreedy Algorithms
相關次數:
  • 被引用被引用:1
  • 點閱點閱:127
  • 評分評分:
  • 下載下載:1
  • 收藏至我的研究室書目清單書目收藏:0
近年來由於人類在工業上的迅速發展,使得人們對於產品的汰換率只高不低,與此同時也不斷加速了資源與能源的消耗,對地球的生態造成了極大影響。因此人們開始反思並追溯汙染的起源,而在生產產品前的設計改善及產品生產後的回收處理就變得尤其重要,若有一套完善的廢棄物回收流程和提高回收材料的再使用性即可大幅減少自然資源的使用,並延生出綠色設計的想法,綠色設計即是在產品階段時就需將節能、預防污染、循環再用、減量設計、易拆解等條件納入產品設計之中,使產品更符合環保訴求之綠色產品。因此本研究企圖提出以Connector為基的拆裝順序規劃,首先透過FAST(Function Analysis System Technique)功能分析將產品Connector功能評估出來後,探討產品功能設計是否符合產品的設計價值,並以方向干涉關係建構釋放圖來表達零件間的拆裝優先順序,將拆裝成本計算方式結合本研究所提出的Connector拆裝時間矩陣,使用貪婪演算法尋找符合優先順序下最小化拆裝成本之拆裝順序,完成以Connector為基礎的全部拆裝規劃;藉由符合FAST主要功能和具有拆解價值的Connector功能模組建立目標性拆裝,尋求拆裝至目標Connector的拆裝順序,並依據FAST將不必要或缺失的功能進行重新設計給予使用者建議,在不影響產品功能和使用性能等方面,應當考慮緊縮設計(減小、體積和重量)節約材料,將Connector模組進行改善,以減少拆解成本,使產品更符合綠色設計。本文中以固定座、釘書機等相關範例來說明。
In recent years, industrial changes are rapidly changing and developing, the replacement of product is getting faster. Therefore, this change has accelerated the consumption of resources and energy, and has greatly affected the ecology of the Earth. People start thinking about the environmental protection issues. To improve this problem, we must trace the origin of corporate activities - product design. If we improving the reuse of recycled materials means reducing the use of natural resources. This should be the meaning of green design, and the current environment can be taken care of and protected. Green design means that energy conservation, pollution prevention, recycling, design reduction, and easy disassembly are included in the product design at the product stage, so that the designed green products can better meet environmental protection demands. Furthermore, the disassembly cost is calculated in conjunction with the connector disassembly time matrix, and the optimal disassembly sequence is determined using the greedy algorithm. The optimal solution can be called the complete connector-based disassembly planning. Target connector-based disassembly plan can be established by evaluating the main functional considerations and disassembly values from the FAST (Function Analysis System Technique). Designers can redesign the product according to the connector-based disassembly sequence and FAST functional model. Through compact design (reduction, volume, weight and material savings), the connector module can be improved to reduce disassembly costs and to be more compliant with green design. In this study, the proposed method is illustrated by some examples such as fixed support and stapler.
摘要 i
ABSTRACT ii
致謝 iii
目錄 iv
圖目錄 vi
表目錄 vii
第一章 緒論 1
第二章 文獻回顧 4
第三章 研究流程 7
3.1產品設計 9
3.2 Connector之分群 10
3.2.1 FAST diagram產品功能分析圖 11
3.3建構釋放圖 14
3.4 MTM動素衡量拆裝時間 18
3.5判定共有零件與共有零件連接線(Arc)之歸屬(Step 5) 21
3.6總拆裝時間 23
3.7成本評估 26
3.7.1成本評估公式 26
3.7.2 Cm最大回收收入以固定座為例 30
3.7.3 Cm拆裝成本以固定座為例 30
3.8 貪婪演算法 33
3.8.1以貪婪演算法規劃全部拆裝順序以固定座為例 35
3.8.2以Connector基進行全部拆裝規劃之優點 36
第四章 案例測試 37
4.1產品設計-釘書機 37
4.2釘書機Connector分群 38
4.2.1釘書機FAST diagram 39
4.3建構釘書機之釋放圖 40
4.4MTM動素衡量釘書機拆裝時間 44
4.5判定釘書機之共有零件與共有零件連接線之歸屬 46
4.6總拆裝時間-釘書機 48
4.7釘書機成本評估 52
4.8以貪婪演算法規劃全部拆裝順序以釘書機為例 54
4.9Connector拆解價值 55
4.9.1釘書機 Connector拆解價值 55
4.10建立目標性拆裝 56
4.11重新改善 57
第五章 結論 60
參考文獻 61
[1]何承叡,2006,以Connector為基之拆裝規劃,國立勤益科技大學,碩士論文。
[2]呂紹鴻,2009,以Connector為基支援綠色生命週期拆裝規劃之研究,國立勤益科技大學,碩 士論文。
[3]黃裕哲,2001,綠色模組化設計之評估架構研究以電動自行車組裝與拆解為例,大葉大學設計 研究所碩士論文。
[4]Benjamin W. Niebel., 1993, "Motion and Time Study", Homewood, IL:Irwin.
[5]Charles W. Bytheway., 2007, "FAST Creativity and Innovation, J Ross Publishing.
[6]Das S. k. and Naik S., 2002, "Process planning for product disassembly" International Journal of Production Research, Vol. 40, No.6, pp.1334-1355.
[7]De Fazio, L. T. and D. E. Whitney., 1987, "Simplified generation of all mechanical assembly sequences," IEEE Journal of Robotics and Automations,Vol. 3,No.6, pp. 640-658.
[8]Gao L., Zhanga C., Lia X. and L., 2014, "Discrete electromagnetism-like mechanism algorithm for assembly sequences planning", International Journal of Production Research, Vol. 52, No.12, pp. 3484-3503.
[9]Ghandi, S. and Masehian, E., 2015, "A breakout local search (BLS) method for solving the assembly sequence planning problem", Engineering Applications of Artificial Intelligence, Vol.39, pp. 245-266.
[10]Gui, J. K. and M. M?ntyl?., 1994, "Functional Understanding of Assembly Modeling", Computer-Aided Design, Vol. 26, No.6, pp. 435-451.
[11]Highfill, J. and McAsey, M., 1997, "Municipal waste management: recycling and landfill space constraints", Journal of Urban Economics, Vol. 41, No 1, pp.118-136.
[12]Huisman J., Boks, C.B., Stevels, A.L.N., 2003, "Quotes for environmentally weighted recyclability (QWERTY): concept of describing product recyclability in terms of environmental value", International Journal of Production Research, Vol. 41, No.16, pp.3649-3665.
[13]Ilgin, A. M. and Gupta S. M., 2010, " Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art", Journal of Urban Econmics., Vol.91 , pp.563-591
[14]Johnson, M. R. and Wang, M. H., 1995, "Planning product disassembly for material recovery opportunities. International journal of production research, Vol. 33, No.11, pp.3119-3142.
[15]Kuo, T. C., 2000, "Disassembly sequence and cost analysis for electromechanical products", Robotics and Computer-Integrated Manufacturing, Vol.16, No.1, pp.43-54.
[16]L. S. Homem de Mello and A. C. Sanderson., 1990, "AND/OR Graph Representation of Assembly Plans", IEEE Trans. Robotics Automat, Vol.6, No. 2, pp.188-199.
[17]Lambert, A. J. D., and Gupta, S. M., 2005, "Disassembly modeling for assembly, maintenance, reuse, and recycling. The St. Lucie Press/APICS series on resource management.Li J., Wang Q., Shen H., and Huang P., 2010, "A CAD-Integrated Prototype for Disassembly Constraint Modelling", International Conference On Computer Design And Appliations., Vol.10 , No. 4 , pp. 112-115.
[18]Otto, K. and Wood, k., 2001, Product Design, Prentice Hall.
[19]Smith, S., Smith, G., Chen W., 2012, "Disassembly sequence structure graphs: An optimal approach for multiple-target selective disassembly sequence planning?, Advanced Engineering Informatics, Vol. 26 , pp. 306-316.
[20]Srinivasan, H., Figueroa, R., Gadh, R., 2003, "Selective disassembly for virtual prototyping as applied to de-manufacturing", Robotic Computer- Integrated Manfacturing., Vol. 15 , No. 3 ,pp. 231-245.
[21]Su, Y. Y., Liang, D., and Dong, H., 2014, "Connector structure-based modeling of assembly sequence planning", In Applied Mechanics and Materials ,Vol. 496, pp. 2729-2732. Trans Tech Publications.
[22]Tseng, H. E., Li, J. D., and Chang, Y. H., 2004, "Connector-based approach to assembly planning using a genetic algorithm. International Journal of Production Research", Vol. 42, No. 11, pp.2243-2261.
[23]Tseng, H.E. and Li, R.K., 1999, "Anovel means of generating assembly sequences using the connector concept", Journal of Intelligent Management, Vol. 10, No. 5, pp. 423-435.
[24]Yin, Z., Ding, H., Li, H., and Xiong, Y., 2003, "A connector-based hierarchical approach to assembly sequence planning for mechanical assemblies", Computer-Aided Design, , Vol. 35 , No. 1,pp. 37-56.
[25]Yuan, B., Zhang, C., Lian, K., and Shao X., 2012, "A hybrid honey-bees mating optimization algorithm for assembly sequence planning problem", International Conference on Natural Computation., Vol. 10, No. 4, pp.1134-1140.
[26]Zeng, C., Gu, T., Zhong, Y., and Cai, G., 2011, "A multi-agent evolutionary algorithm for connector-based assembly sequence planning", Procedia Engineering., Vol. 15, pp. 3689-3693.


QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top