結合組裝方法評估之組裝及拆卸次序規劃-應用粒子群演算法

Integrated Assembly and Disassembly Sequence Planning Using Particle Swarm Optimization

游芳瑜(Fang-Yu Yu)

指導教授 ： 鄭元杰

元智大學/工程學院/工業工程與管理學系/碩士(2009年)

摘要

近年來環保意識提升，世界各國紛紛訂定環保規範，歐盟於2005年開始實施的廢電機電子設備指令（Waste Electrical and Electronic Equipment, WEEE），要求企業必須負起電機電子產品使用後的回收責任。據研究顯示，產品開發的成敗超過三分之二的部分，於設計階段時便已決定，因此鼓勵產品設計師在設計產品之初，需從產品整個生命週期來考量。因此考慮產品使用後的拆卸與回收之成本便成為一個相當重要的課題。
在過去研究中，多將產品的拆卸順序假設為組裝順序的相反，但在實際情況裡，只要不影響產品幾何上的干涉限制，拆卸次序不一定為組裝順序的相反。另外，企業在進行產品製程設計時，零件間可能有多個組裝方案供選擇，一些成本低的組裝方法及順序，可能會增加拆卸的成本。有鑑於此，本研究將使用一套有系統的成本評估模式，以總成本最小化為目標，使用粒子群演算法做為求解工具，透過粒子群演算法的編碼技巧，於同一個求解空間中同時進行組裝次序及拆卸次序的編碼，經過轉譯之後即可的到一組最佳組裝方案之組裝次序及拆卸次序。最後使用窮舉法，一一列舉出所有可行的組合，進行驗證與比較。

關鍵字

組裝次序規劃 ； 拆卸次序規劃 ； 粒子群演算法 ； 窮舉法

並列摘要

In light of the raising environmental consciousness, there are more and more countries adopting policies on sustainability. European Union applied the Waste Electrical and Electronic Equipment regulations, which require the enterprises who sell the electrical product to Europe take the responsibility for recycling the product. Some research has shown that more than two thirds of products’ success is almost decided on the design stage. Therefore, product designers nowadays are encouraged to design their products based on the product life cycle. As a result, considering a product’s disassembly and recycle cost becomes an important issue.

In the past, most research considers a product’s disassembly sequence to be the inverse of assembly sequence. But in real case as long as it doesn’t against the product’s assembly interference, the disassembly sequence need not to be the inverse of assembly. In addition, when a company designs their product manufacturing process, there could be many assembly alternatives to choose from – The assembly method with lower cost might have much higher disassembly cost. Hence, in this research we will use a total cost estimation method to the minimization of the total cost. Using Particle Swarm Optimization (PSO) as the solving tool, through the coding technique, we try to solve the assembly sequence and disassembly sequence at the same dimension search space. After a decoding process, we would get a best assembly method, assembly sequence, and disassembly sequence. Finally we use Exhaustive Enumeration Method to enumerate all the possible sequences to compare with the results of PSO.

並列關鍵字

Assembly Sequence Planning ； Disassembly Sequence Planning ； Particle Swarm Optimization ； Exhaustive Enumeration Method

參考文獻

1. Chatterjee, A., and Siarry, P., “Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization,” Computers & Operations Research, vol. 33, pp. 859-871, 2006.

2. Chen, R. S., Lu, K. Y., and Tai, P. H., “Optimizing assembly planning through a three-stage integrated approach.” International Journal of Production Economics, vol. 88, no. 3, pp. 243-256, 2004.

4. Dini, G.. M., “Automated sequencing and subassembly detection in assembly planning.” CIRP Annals - Manufacturing Technology 41, no. 1, pp. 1-4, 1992.

5. Dong, Q., Kan, S., and Huang, Z., “Sequencing mixed model assembly lines based on a modified particle swarm optimization multi-objective algorithm,” Proceedings of IEEE International Conference on Automation and Logistics, pp. 2818-2823, 2007.

8. Moore, K. E., Gungor, and A., Gupta, S., ” Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships”European Journal of Operational Research, vol. 135, no. 2, pp. 428-449, 2001.