臺灣博碩士論文加值系統

本文以二進位數字合併簡化組件關係表示法，應用在干涉矩陣上，產生初步可行解，再配合接觸矩陣與拆卸順序矩陣，同樣以二進位數字合併，簡化組件之接觸關係與特殊連結關係，所產生之不穩定性評估函數，與工具變換和拆卸方向變換，以及重力影響因素形成一多重目標之最佳化目標函數，以遺傳演算法進行編碼，使其經拆卸程序解族群的再生、交配、突變，並撰寫C++電腦程式，測試方法的正確性與實用性，以輔助搜尋出最佳拆卸程序。

This study used the binary number to simplify the relations between parts in a product. The interference matrix was used to correct and generate the initial feasible solution. Then, the special connection relation with disassembly sequence matrix. Finally, the unstability function during the disassembly process with the contact matrix, tool changing function, disassemble direction function, and inconvenient function due to gravity to form an multi-objective function was evaluated. With the genetic algorithm, the optimum disassembly process can be obtained. This methodology can be used to improve the product disassembly for the environmental protection.

第一章緒論………………………………………………………….….1
1-1 研究動機...……………………………………………………..1
1-2 文獻回顧...……………………………………………………..2
1-3 有關拆卸與組裝之文獻探討...………………………………..9
1-4 研究目的...……………………………………………………12
1-5 研究方法...……………………………………………………12
1-6 重要性...………………………………………………………13
1-7 章節概要...……………………………………………………14
第二章遺傳演算應用於拆卸之流程介紹……………………………15
2-1 簡介...…………………………………………………………15
2-2 主要流程...……………………………………………………15
2-3 編碼方式...……………………………………………………18
2-4 產生初始族群...………………………………………………18
2-5 解的修正...……………………………………………………19
2-6 適合度值的計算...……………………………………………24
2-7 族群再生運算...………………………………………………25
2-8 族群交配運算...………………………………………………26
2-9 族群突變運算...………………………………………………26
2-10 迴圈停止條件...……………………………………………..27
第三章目標函數的設定………………………………………………29
3-1 不穩定函數值...………………………………………………32
3-2 拆卸方向變換耗時函數值...…………………………………37
3-3 工具變換耗時函數值...………………………………………38
3-4 重力影響函數值...……………………………………………39
3-5 各函數值係數設定...…………………………………………39
3-6 有關壞掉零件 (defect parts) 拆卸之程序的探討...………...39
第四章實例探討－旋轉式壓縮機……………………………………41
4-1 全體拆卸例子驗證………...…....……………………………41
4-2 部份拆卸例子驗證……...……………………………………46
4-3實例探討-旋轉式壓縮機...……………………………………49
第五章討論……………………………………………………………66
5-1 產品模型 (model) 幾何關係上的對稱...…………………...66
5-2 最佳拆卸程序的不穩定性降到最底...………………………67
5-3 兼顧拆卸最少方向變化 (單一軸向) ...……………………..67
5-4 z軸拆卸之概念...……………………………………………67
5-5 最佳拆卸程序解可做為產品更改設計的依據...……………67
第六章結論與展望……………………………………………………69
6-1 承襲了二進位運算的優點...…………………………………69
6-2 加入比較一般 (general) 的修正式...……………………….69
6-4最佳拆卸程序解與組裝程序的關係………………………....70
6-3 未來展望...……………………………………………………70

[1] Gottipolu, R. B., and Ghosh, K., 1997, “Representation and Selection of Assembly Sequences in Computer-Aided Assembly Process Planning,” International Journal of Production Research, Vol. 35, No. 12, pp. 3447-3465.
[2] Laperrière, L., El-Maraghy H. A., 1994, “Assembly Sequences Planning for Simultaneous Engineering Applications,” International Journal of Advanced Manufacturing Technology, Vol. 9, No. 4, pp. 231-244.
[3] Fazio De, T. L., and Whitney, D. E., 1997, “Simplified Generation of All Mechanical Assembly Sequence,” IEEE Robot Automation, Vol. RA-3, No. 6, pp. 640-658.
[4] Dini, G., and Santochi, M., 1992, “Automated Sequencing and Subassembly Detection in Assembly Planning,” Annals of the CIRP, Vol. 41, No. 1, pp. 1-4.
[5] 黃俊廷, 1999, 電腦輔助拆卸程序產生及評估, 國立台灣大學
機械工程研究所, 碩士論文。
[6] Ko, H., and Lee, K., 1987, “Automatic Assembling Procedure
Generation from Mating Conditions,” Computer-Aided Design, Vol. 19, No. 1, pp. 5-10.
[7] Tonshoff, H. K., Menzel, E., and Park, H. S., 1992, “A Knowledge-Based System for Automated Assembly Planning,” Annals of the CIRP, Vol. 41, No. 1, pp. 19-24.
[8] Bonneville, F., Perrard, C., Henrioud, J. M., 1995, “A Genetic Algorithm to Generate and Evaluate Assembly Plans,” IEEE Symposium on Emerging Technologies & Factory Automation, , Vol. 41, No. 1,pp.231-239.
[9] 楊家豪, 1997, 以遺傳演算法應用於電腦輔助裝配程序規劃問題
之研究, 國立台灣大學工業工程研究所, 碩士論文。
[10] Choi, C. K., and Zha, X. F., 1998, “On the Automatic Generation of Product Assembly Sequences,” International Journal of Production Research, Vol. 36, No. 3, pp. 617-633.
[11] Arai, E., and Iwata, K., 1993, “CAD System with Product
Assembly/Disassembly Planning,” Robotics and Computer-Integrated Manufacturing, Vol. 10, No. 1-2, pp. 41-48.
[12] Zussman, E., Kriwet, A., and Seliger, G., 1994,
“Disassembly-Oriented Assessment Methodology,” Annals of the CIRP, Vol. 43, No. 1, pp. 9-14.
[13] Lambert, A. J. D., 1997, “Optimal Disassembly of Complex
Products,” International Journal of Production Research, Vol. 35, No. 9, pp. 2509-2523.
[14] Gungor, A. and Gupta, S. M., 1998, “Disassembly
Sequence Planning for Products with Defective Parts in Product Recovery ,” Computers & Industrial Engineering Proceedings of the 1997 23rd International Conference, USA, Elsevier Sci Ltd Exeter Engl p 161-164.
[15] Gungor, A., and Gupta, S. M., 1997, “Evaluation Methodology for Disassembly Processes,” Computers & Industrial Engineering, Vol. 33, No. 1-2, pp. 329-332.
[16] John Holland, 1975, Adaptation in natural and artificial systems.
[17] Goldberg, David E., 1989, Genetic Algorithms in Search,
Optimization, and Machine Learing, Addison-Wesley.
[18] Takeshi, M., Fuminori, O., Shigeki, A., and Yoshiyuki, Y., 2001, “Disassembly Sequence Generation using Information Entropy and Heuristics for Component Replacement,” International Symposium on Assembly and Task Planning, Vol. 41, No. 1, pp. 208-213.