Abstract
In this article, we investigate the component assignment problem, which involves determining the optimal component arrangement for maximizing system reliability, given individual component reliabilities. Establishing the optimal arrangement is crucial for the cost-effective design of dependable systems. We focus on the adjacent triangle-(m, n):F triangular lattice system, characterized by mn components arranged in a triangular grid. The system fails when three neighboring components located at the vertices of a triangle fail simultaneously. Applications of this system extend to surveillance camera systems, sprinkler systems, and sensing systems. To date, no algorithm has been reported for finding the optimal arrangement of the adjacent triangle-(m, n):F triangular lattice system. Therefore, this paper aims to develop an algorithm using the branch-and-bound method to determine the optimal arrangement of the adjacent triangle-(m, n):F triangular lattice system. To efficiently acquire the optimal arrangement, we derived three pruning conditions and devised an optimal arrangement search algorithm incorporating them. Computational experiments revealed that all pruning conditions decreased computation time. Specifically, the pruning condition based on necessary conditions reduced computation time on average by approximately 1/9, as demonstrated experimentally. The solutions provided by the proposed algorithm ensure optimality, enabling the assessment of approximation methods, such as metaheuristics.
Supported by Grant-in-Aid for JSPS KAKENHI Grant Numbers 21K14370.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akiba, T., Yamamoto, H., Kainuma, Y.: Reliability of a \(3\)-dimensional adjacent triangle: F triangular lattice system. In: Proceedings of the 5th Asia Pacific Industrial Engineering and Management Systems, pp. 1–10 (2004)
Birnbaum, Z.W.: On the importance of different components in a multicomponent system. Washington Univ Seattle Lab of Statistical Research, Technical Report (1968)
Boehme, T.K., Kossow, A., Preuss, W.: A generalization of consecutive-\(k\)-out-of-\(n\): f systems. IEEE Trans. Reliabil. 41(3), 451–457 (1992)
Boland, P.J., Proschan, F., Tong, Y.L.: Optimal arrangement of components via pairwise rearrangements. Naval Res. Logist. 36(6), 807–815 (1989) https://doi.org/10.1002/1520-6750(198912)36:6<807::AID-NAV3220360606>3.0.CO;2-I
Cai, Z., Si, S., Sun, S., Li, C.: Optimization of linear consecutive-\(k\)-out-of-\(n\) system with a Birnbaum importance-based genetic algorithm. Reliabil. Eng. Syst. Saf. 152, 248–258 (2016). https://doi.org/10.1016/j.ress.2016.03.016
Hanafusa, T., Yamamoto, H.: Branch and bound algorithm for the optimal assignment problem in linear consecutive-\(k\)-out-of-\(n\): F system. Reliabil. Eng. Assoc. Japan (in Japanese) 22(7), 641–661 (2000)
Hwang, F.K.: Fast solutions for consecutive-\(k\)-out-of-\(n\): F system. IEEE Trans. Reliabil. 31(5), 447–448 (1982). https://doi.org/10.1109/TR.1982.5221426
Kuo, W., Zhu, X.: Importance Measures in Reliability, Risk, and Optimization: Principles and Applications. Wiley, Hoboken (2012)
Lin, F.H., Kuo, W.: Reliability importance and invariant optimal allocation. J. Heuristics 8(2), 155–171 (2002). https://doi.org/10.1023/A:1017908523107
Nakamura, T., Yamamoto, H.: Algorithm for solving optimal arrangement problem in connected-\((r, s)\)-out-of-\((m, n)\):f lattice system. IEEE Trans. Reliabil. 69(2), 497–509 (2020). https://doi.org/10.1109/TR.2019.2925142
Nakamura, T., Yamamoto, H., Akiba, T.: Fast algorithm for optimal arrangement in connected-\((m-1, n-1)\)-out-of-\((m, n)\): F lattice system. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101(12), 2446–2453 (2018)
Omura, T., Akiba, T., Yamamoto, H., Xiao, X.: Algorithm for obtaining optimal arrangement of a connected-\((r, s)\)-out-of-\((m, n)\): F system – the case of \(m=r\) and \(s=2\) –. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E98-A(10), 2018–2024 (2015). https://doi.org/10.1587/transfun.E98.A.2018
Salvia, A.A., Lasher, W.C.: \(2\)-dimensional consecutive-\(k\)-out-of-\(n\): F models. IEEE Trans. Reliabil. 39(3), 382–385 (1990). https://doi.org/10.1109/24.103023
Shingyochi, K., Yamamoto, H., Yamachi, H.: Comparative study of several simulated annealing algorithms for optimal arrangement problems in a circular consecutive-\(k\)-out-of-\(n\): F system. Q. Technol. Quant. Manage. 9(3), 295–303 (2012). https://doi.org/10.1080/16843703.2012.11673293
Wang, W., Cai, Z., Zhao, J., Si, S.: Optimization of linear consecutive-k-out-of-n systems with Birnbaum importance based ant colony optimization algorithm. Journal of Shanghai Jiaotong University (Science) 25(2), 253–260 (2019). https://doi.org/10.1007/s12204-019-2125-z
Yamamoto, H., Akiba, T., Wakagi, Y.: Efficient algorithm for the reliability of an adjacent triangle: F triangular lattice system. Reliabil. Eng. Assoc. Japan (REAJ) 28(1), 63–73 (2006)
Yamamoto, H., Miyakawa, M.: The reliability of the adjacent triangle: F triangular lattice system. J. Reliabil. Eng. Assoc. Japan (in Japanese) 7(18), 97–105 (1996)
Yao, Q., Zhu, X., Kuo, W.: A Birnbaum-importance based genetic local search algorithm for component assignment problems. Ann. Oper. Res. 212(1), 185–200 (2014). https://doi.org/10.1007/s10479-012-1223-1
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Nakamura, T. (2023). Proposal of an Algorithm for Solving the Component Assignment Problem of an Adjacent Triangle-(m, n):F Triangular Lattice System. In: Saeed, K., Dvorský, J., Nishiuchi, N., Fukumoto, M. (eds) Computer Information Systems and Industrial Management. CISIM 2023. Lecture Notes in Computer Science, vol 14164. Springer, Cham. https://doi.org/10.1007/978-3-031-42823-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-031-42823-4_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-42822-7
Online ISBN: 978-3-031-42823-4
eBook Packages: Computer ScienceComputer Science (R0)