Reliability optimization and importance analysis of circular-consecutive \(k\)-out-of-\(n\) system (Q1992414): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2017/1831537 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2748982559 / rank
 
Normal rank

Revision as of 00:14, 20 March 2024

scientific article
Language Label Description Also known as
English
Reliability optimization and importance analysis of circular-consecutive \(k\)-out-of-\(n\) system
scientific article

    Statements

    Reliability optimization and importance analysis of circular-consecutive \(k\)-out-of-\(n\) system (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 November 2018
    0 references
    Summary: The circular-consecutive \(k\)-out-of-\(n\):\(F(G)\) system (Cir/Con/\(k/n\):\(F(G)\) system) usually consists of \(n\) components arranged in a circle where the system fails (works) if consecutive \(k\) components fail (work). The optimization of the Cir/Con/\(k/n\) system is a typical case in the component assignment problem. In this paper, the Birnbaum importance-based genetic algorithm (BIGA), which takes the advantages of genetic algorithm and Birnbaum importance, is introduced to deal with the reliability optimization for Cir/Con/\(k/n\) system. The detailed process and property of BIGA are put forward at first. Then, some numerical experiments are implemented, whose results are compared with two classic Birnbaum importance-based search algorithms, to evaluate the effectiveness and efficiency of BIGA in Cir/Con/\(k/n\) system. Finally, three typical cases of Cir/Con/\(k/n\) systems are introduced to demonstrate the relationships among the component reliability, optimal permutation, and component importance.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references