臺灣博碩士論文加值系統

系統可靠度不僅是工業系統設計參數之一，更是產品的重要品質特性。隨著系統結構日趨複雜化，高可靠度的產品往往須經過精密的系統設計，因此許多產品在進行可靠度設計之時，常採用串並聯系統以提高系統之可靠度，但是串並聯系統的設計往往受到研發成本與重量限制因素影響，導致備用元件配置的數量與品質都會有所限制，故經常無法符合實務的要求。過去相關之可靠度研究，多專注於串並聯系統複置元件配置上，鮮少討論針對個別獨立的子系統中容許搭配不同複置策略類型，其中將包含主動式複置元件、冷備用式複置元件或者是不搭配任何備用元件的不同複置策略類型，故本研究針對串並聯系統，加入複置策略類型選擇之條件，建構系統整體複置最佳設計配置組合。

本研究以系統可靠度最佳化和成本最小化為前提，符合限制條件的要求，使用一啟發式演算法－變動鄰域搜尋法，並且依照不同問題之條件，提出兩種不同編碼模式。此演算法藉由系統化區域搜尋的方式，尋找在滿足系統限制條件下系統目標最佳化之複置配置狀態，並利用兩組測試例題，與其他文獻之方法進行比較，結果顯示變動鄰域搜尋法在串並聯系統複置配置問題上，能夠有效的提供最佳的元件組合以及複置策略，以提供系統設計者參考。

System reliability is not only one of the parameters in engineering design, but also an important characteristic of product quality. With the increasing complexity of system structures, high-reliability products are often subject to complicated design. Therefore, many products during the reliability design often employ the series-parallel system to enhance system reliability. However, the series-parallel system design is often subject to research and development’s cost and weight limits, so fail to reach practical requirements. In the past studies, the design of reliability systems is more focused on redundancy allocation of series-parallel system. The employment of redundancy strategies such as active, cold-standby, or no redundancy is rarely discussed. Therefore, this study aims at determining optimal of the series-parallel systems configurations with a choice of redundancy strategies.

This research considers either system reliability maximization or the cost minimization, accord with the restrictions of actual condition, using a metaheuristic algorithm － variable neighborhood search method. This study proposes two different encoding structures, and adapts neighborhood searches in a systematical way. The proposed algorithms are run using two test suites and compared with methods in the literatures. The results show that the proposed algorithms perform very well in both quality and computational effort. It also indicates the consideration of redundancy strategies help to enhance the system performance.

目錄
摘 要 ii
ABSTRACT iii
致 謝 v
目錄 vii
圖目錄 ix
表目錄 x
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 3
1.3 研究範圍 3
1.4 研究架構與流程 4
第二章 文獻探討 6
2.1 可靠度系統架構 6
2.2 複置配置策略(redundancy allocation strategy) 8
2.3串並聯系統複置配置問題探討 11
2.3.1主動式之串並聯系統複置配置問題 12
2.3.2 考慮複置策略之串並聯系統複置配置問題 20
2.4 變動鄰域搜尋演算法 22
2.4.1 變動鄰域搜尋法之類型 22
2.4.2 變動鄰域搜尋法之應用 25
第三章 研究方法 29
3.1 串並聯系統複置配置問題描述 29
3.1.1 符號說明 30
3.1.2 複置配置問題之假設條件 30
3.1.3 數學模式 31
3.2 變動鄰域搜尋法之演算架構 36
3.3 初始化設定 39
3.3.1 初始解 39
3.4 鄰域結構(Nk) 42
3.4.1 震動(Shaking)機制 43
3.4.2 區域搜尋(Local Search)機制 51
3.4.3 懲罰函數 63
第四章 結果分析 65
4.1 測試例題說明 65
4.2 參數設定 66
4.3.1 變動鄰域搜尋法之兩種編碼比較 67
4.3 結果比較 70
4.3.1 測試例題一之結果比較 70
4.3.2 測試例題二之結果比較 76
第五章 結論及未來研究方向 82
5.1 研究結論 82
5.2 未來研究方向 83
參考文獻 84
附錄A 測試例題可供選擇元件列表 87
附錄B 變動鄰域搜尋法演算結果列表 88

參考文獻
1.Amari, S.V. and G. Dill, A new method for reliability analysis of standby systems. Reliability and Maintainability Symposium, RAMS, Annual, 2009: p. 417-422.
2.Amari, S.V. and G. Dill, Redundancy optimization problem with warm-standby redundancy. Reliability and Maintainability Symposium (RAMS), Proceedings - Annual, 2010: p. 1-6.
3.Blischke, W.R. and N. D, Prabhakar Murthy, Reliability Improvement, in Reliability Modeling, Prediction, and Optimization. 2000, Wiley-Interscience. p. 537-557.
4.Carrabs, F., J.F. Cordeau, and G. Laporte, Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS Journal on Computing, 2007. 19: p. 618-632.
5.Chen, T.-C. and P.-S. You, Immune algorithms-based approach for redundant reliability problems with multiple component choices. Computers in Industry, 2005. 56(2): p. 195-205.
6.Chern, M.-S., On the computational complexity of reliability redundancy allocation in a series system. Operations Research Letters, 1992. 11(5): p. 309-315.
7.Coit, D., Cold-standby redundancy optimization for nonrepairable systems. IIE Transactions, 2001. 33(6): p. 471-478.
8.Coit, D.W., Maximization of System Reliability with a Choice of Redundancy Strategies. IIE Transactions, 2003. 35(6): p. 535 - 543.
9.Coit, D.W. and A.E. Smith, Penalty guided genetic search for reliability design optimization. Computers & Industrial Engineering, 1996. 30(4): p. 895-904.
10.Coit, D.W. and A.E. Smith, Reliability optimization of series-parallel systems using a genetic algorithm. IEEE Transactions on Reliability, 1996. 45(2): p. 254-260, 266.
11.Fyffe, D.E., W.W. Hines, and N.K. Lee, System Reliability Allocation and a Computational Algorithm. IEEE Transactions on Reliability, 1968. R-17(2): p. 64-69.
12.Gao, L.-f. and W. Dong, A Parallel variable neighborhood search for the Traveling Salesman Problem. IEEE International Conference on Advanced Management Science (ICAMS), 2010. 3: p. 150-152.
13.Hansen, P. and N. Mladenovic, Variable neighborhood search: Principles and applications. European Journal of Operational Research, 2001. 130(3): p. 449-467.
14.Hansen, P., N. Mladenović, and J. Moreno Perez, Variable neighbourhood search: methods and applications. Annals of Operations Research, 2010. 175(1): p. 367-407.
15.Javadian, N., et al., Solving assembly flowshop scheduling problem with parallel machines using Variable Neighborhood Search. International Conference on Computers & Industrial Engineering, 2009: p. 102-107.
16.Kulturel-Konak, S., A.E. Smith, and D.W. Coit, Efficiently Solving the Redundancy Allocation Problem Using Tabu Search. IIE Transactions, 2003. 35(6): p. 515 - 526.
17.Liang, Y.-C. and Y.-C. Chen, Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliability Engineering & System Safety, 2007. 92(3): p. 323-331.
18.Liang, Y.-C. and M.-H. Lo, Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm. Journal of Heuristics, 2010. 16(3): p. 511-535.
19.Liang, Y.-C. and A.E. Smith, An ant colony optimization algorithm for the redundancy allocation problem (RAP). IEEE Transactions on Reliability, 2004. 53(3): p. 417-423.
20.Liang, Y.C. and C.C. Wu, A Variable Neighborhood Descent Algorithm for the Redundancy Allocation Problem. Industrial Engineering and Management Systems, 2005. 4: p. 109-116.
21.Lo, M.-H., Y.-C. Liang, and J.-C. Hsieh, A modified variable neighborhood search algorithm for orienteering problems. 40th International Conference on Computers and Industrial Engineering (CIE), 2010: p. 1-6.
22.Mladenovic, N. and P. Hansen, Variable neighborhood search. Computers & Operations Research, 1997. 24(11): p. 1097-1100.
23.Nahas, N., M. Nourelfath, and D. Ait-Kadi, Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series-parallel systems. Reliability Engineering & System Safety, 2007. 92(2): p. 211-222.
24.Nahas, N. and D. Thien-My, Harmony search algorithm: application to the redundancy optimization problem. Engineering Optimization, 2010. 42(9): p. 845 - 861.
25.Nakagawa, Y. and S. Miyazaki, Surrogate Constraints Algorithm for Reliability Optimization Problems with Two Constraints. IEEE Transactions on Reliability, 1981. R-30(2): p. 175-180.
26.Onishi, J., et al., Solving the Redundancy Allocation Problem With a Mix of Components Using the Improved Surrogate Constraint Method. IEEE Transactions on Reliability, 2007. 56(1): p. 94-101.
27.Ouzineb, M., M. Nourelfath, and M. Gendreau, An efficient heuristic for reliability design optimization problems. Computers & Operations Research, 2010. 37(2): p. 223-235.
28.Tavakkoli-Moghaddam, R., J. Safari, and F. Sassani, Reliability optimization of series-parallel systems with a choice of redundancy strategies using a genetic algorithm. Reliability Engineering & System Safety, 2008. 93(4): p. 550-556.
29.Tillman, F.A., C.-L. Hwang, and W. Kuo, Optimization Techniques for System Reliability with Redundancy - A Review. IEEE Transactions on Reliability, 1977. R-26(3): p. 148-155.
30.You, P.-S. and T.-C. Chen, An efficient heuristic for series-parallel redundant reliability problems. Computers & Operations Research, 2005. 32(8): p. 2117-2127.
31.田佳芸, 變動鄰域搜尋法於雙目標平行機台排程問題之研究, in 工業工程與管理學系. 2007, 元智大學.
32.林書羽, 應用變動鄰域搜尋法於投資組合最佳化問題之研究, in 工業工程與管理學系. 2009, 元智大學.
33.莊佳穎, 變動鄰域搜尋法於多目標資源分配問題之研究, in 工業工程與管理學系. 2009, 元智大學.
34.郭南極, 變動鄰域搜尋法於多目標專案投資組合問題之研究, in 工業工程與管理學系. 2008, 元智大學.
35.羅敏華, 應用變動鄰域搜尋法求解組合最佳化問題, in 工業工程與管理學系. 2010, 元智大學.