Optimization Methods for Redundancy Allocation in Hybrid Structure Large Binary Systems
This paper addresses the issue of optimal redundancy allocation in hybrid structure large binary systems. Two aspects of optimization are considered: (1) maximizing the reliability of the system under the cost constraint, and (2) obtaining the necessary reliability at a minimum cost. The complex bin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-10-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/10/19/3698 |
| _version_ | 1797478079807881216 |
|---|---|
| author | Petru Cașcaval Florin Leon |
| author_facet | Petru Cașcaval Florin Leon |
| author_sort | Petru Cașcaval |
| collection | DOAJ |
| description | This paper addresses the issue of optimal redundancy allocation in hybrid structure large binary systems. Two aspects of optimization are considered: (1) maximizing the reliability of the system under the cost constraint, and (2) obtaining the necessary reliability at a minimum cost. The complex binary system considered in this work is composed of many subsystems with redundant structure. To cover most of the cases encountered in practice, the following kinds of redundancy are considered: active redundancy, passive redundancy, hybrid standby redundancy with a hot or warm reserve and possibly other cold ones, triple modular redundancy (TMR) structure with control facilities and cold spare components, static redundancy: triple modular redundancy or 5-modular redundancy (5MR), TMR/Simplex with cold standby redundancy, and TMR/Duplex with cold standby redundancy. A classic evolutionary algorithm highlights the complexity of this optimization problem. To master the complexity of this problem, two fundamentally different optimization methods are proposed: an improved evolutionary algorithm and a zero-one integer programming formulation. To speed up the search process, a lower bound is determined first. The paper highlights the difficulty of these optimization problems for large systems and, based on numerical results, shows the effectiveness of zero-one integer programming. |
| first_indexed | 2024-03-09T21:26:57Z |
| format | Article |
| id | doaj.art-c5d9bd5c019b45879f2ecc11f9ecd714 |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-09T21:26:57Z |
| publishDate | 2022-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-c5d9bd5c019b45879f2ecc11f9ecd7142023-11-23T21:05:56ZengMDPI AGMathematics2227-73902022-10-011019369810.3390/math10193698Optimization Methods for Redundancy Allocation in Hybrid Structure Large Binary SystemsPetru Cașcaval0Florin Leon1Faculty of Automatic Control and Computer Engineering, “Gheorghe Asachi” Technical University of Iasi, Bd. Mangeron 27, 700050 Iasi, RomaniaFaculty of Automatic Control and Computer Engineering, “Gheorghe Asachi” Technical University of Iasi, Bd. Mangeron 27, 700050 Iasi, RomaniaThis paper addresses the issue of optimal redundancy allocation in hybrid structure large binary systems. Two aspects of optimization are considered: (1) maximizing the reliability of the system under the cost constraint, and (2) obtaining the necessary reliability at a minimum cost. The complex binary system considered in this work is composed of many subsystems with redundant structure. To cover most of the cases encountered in practice, the following kinds of redundancy are considered: active redundancy, passive redundancy, hybrid standby redundancy with a hot or warm reserve and possibly other cold ones, triple modular redundancy (TMR) structure with control facilities and cold spare components, static redundancy: triple modular redundancy or 5-modular redundancy (5MR), TMR/Simplex with cold standby redundancy, and TMR/Duplex with cold standby redundancy. A classic evolutionary algorithm highlights the complexity of this optimization problem. To master the complexity of this problem, two fundamentally different optimization methods are proposed: an improved evolutionary algorithm and a zero-one integer programming formulation. To speed up the search process, a lower bound is determined first. The paper highlights the difficulty of these optimization problems for large systems and, based on numerical results, shows the effectiveness of zero-one integer programming.https://www.mdpi.com/2227-7390/10/19/3698redundancy allocationhybrid structure binary systemsMarkov chainsevolutionary algorithmsRELIVE algorithmzero-one integer programming |
| spellingShingle | Petru Cașcaval Florin Leon Optimization Methods for Redundancy Allocation in Hybrid Structure Large Binary Systems Mathematics redundancy allocation hybrid structure binary systems Markov chains evolutionary algorithms RELIVE algorithm zero-one integer programming |
| title | Optimization Methods for Redundancy Allocation in Hybrid Structure Large Binary Systems |
| title_full | Optimization Methods for Redundancy Allocation in Hybrid Structure Large Binary Systems |
| title_fullStr | Optimization Methods for Redundancy Allocation in Hybrid Structure Large Binary Systems |
| title_full_unstemmed | Optimization Methods for Redundancy Allocation in Hybrid Structure Large Binary Systems |
| title_short | Optimization Methods for Redundancy Allocation in Hybrid Structure Large Binary Systems |
| title_sort | optimization methods for redundancy allocation in hybrid structure large binary systems |
| topic | redundancy allocation hybrid structure binary systems Markov chains evolutionary algorithms RELIVE algorithm zero-one integer programming |
| url | https://www.mdpi.com/2227-7390/10/19/3698 |
| work_keys_str_mv | AT petrucascaval optimizationmethodsforredundancyallocationinhybridstructurelargebinarysystems AT florinleon optimizationmethodsforredundancyallocationinhybridstructurelargebinarysystems |