Reliability optimization of linear consecutive k-out-of-n: F systems with Birnbaum importance–based quantum genetic algorithm

13Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Component assignment problem is a common challenge of reliability optimization, which is a non-deterministic polynomial hard problem widely used in the linear consecutive k-out-of-n systems. In consideration of the advantages of quantum computing and importance measure, this article proposed a novel algorithm, which is Birnbaum importance–based quantum genetic algorithm, to improve the efficiency and accuracy for solving component assignment problem. First, the model of reliability optimization for linear consecutive k-out-of-n systems is established. Second, the detailed procedure of Birnbaum importance–based quantum genetic algorithm is introduced to solve the component assignment problem. Moreover, the effectiveness and the convergence of the quantum genetic algorithm, Birnbaum importance–based genetic local search, and Birnbaum importance–based quantum genetic algorithm is discussed through two comparative experiments. Finally, the case of production monitor systems is introduced to illustrate the effectiveness of Birnbaum importance–based quantum genetic algorithm comparing with the Birnbaum importance–based two-stage approach.

Cite

CITATION STYLE

APA

Zhang, S., Zhao, J. B., Zhu, W. J., & Du, L. (2019). Reliability optimization of linear consecutive k-out-of-n: F systems with Birnbaum importance–based quantum genetic algorithm. Advances in Mechanical Engineering, 11(4). https://doi.org/10.1177/1687814019842996

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free