Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks
•An improved binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to calculate the for reliability evaluation of acyclic multistate information networks•BAT outperforms UGFM which is the best related algorithm from...
Uložené v:
| Vydané v: | Reliability engineering & system safety Ročník 210; s. 107427 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Barking
Elsevier Ltd
01.06.2021
Elsevier BV |
| Predmet: | |
| ISSN: | 0951-8320, 1879-0836 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •An improved binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to calculate the for reliability evaluation of acyclic multistate information networks•BAT outperforms UGFM which is the best related algorithm from the experiments.•The time complexities of both BAT and UGFM are equal.
Acyclic multistate information network (AMIN), a variant of multistate information network (MIN) that is not dependent on the conservation laws of flow, plays an important role in the current-day network communications because many modern network structures are based on AMIN, e.g., social networks, local area networks (LANs), and 4G/5G networks. An effective evaluation of the network reliability of an AMIN serves as a major and primary metric for determining the performance and quality of the overall network. The network reliability, which was shown to be NP-hard, has been successfully resolved by the universal generation function method (UGFM). However, the UGFM can only address small-scale problems owing to the limitations of the current-day computer memories. To overcome this problem, an improved and enhanced binary-addition tree algorithm (BAT) is proposed in this study to effectively evaluate and analyze the reliability of the AMIN. The performance of the proposed BAT is validated via a few examples. |
|---|---|
| AbstractList | •An improved binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to calculate the for reliability evaluation of acyclic multistate information networks•BAT outperforms UGFM which is the best related algorithm from the experiments.•The time complexities of both BAT and UGFM are equal.
Acyclic multistate information network (AMIN), a variant of multistate information network (MIN) that is not dependent on the conservation laws of flow, plays an important role in the current-day network communications because many modern network structures are based on AMIN, e.g., social networks, local area networks (LANs), and 4G/5G networks. An effective evaluation of the network reliability of an AMIN serves as a major and primary metric for determining the performance and quality of the overall network. The network reliability, which was shown to be NP-hard, has been successfully resolved by the universal generation function method (UGFM). However, the UGFM can only address small-scale problems owing to the limitations of the current-day computer memories. To overcome this problem, an improved and enhanced binary-addition tree algorithm (BAT) is proposed in this study to effectively evaluate and analyze the reliability of the AMIN. The performance of the proposed BAT is validated via a few examples. Acyclic multistate information network (AMIN), a variant of multistate information network (MIN) that is not dependent on the conservation laws of flow, plays an important role in the current-day network communications because many modern network structures are based on AMIN, e.g., social networks, local area networks (LANs), and 4G/5G networks. An effective evaluation of the network reliability of an AMIN serves as a major and primary metric for determining the performance and quality of the overall network. The network reliability, which was shown to be NP-hard, has been successfully resolved by the universal generation function method (UGFM). However, the UGFM can only address small-scale problems owing to the limitations of the current-day computer memories. To overcome this problem, an improved and enhanced binary-addition tree algorithm (BAT) is proposed in this study to effectively evaluate and analyze the reliability of the AMIN. The performance of the proposed BAT is validated via a few examples. |
| ArticleNumber | 107427 |
| Author | Lin, Yih-Lon Wang, Gai-Ge Yeh, Wei-Chang Hao, Zhifeng Forghani-elahabad, Majid |
| Author_xml | – sequence: 1 givenname: Wei-Chang surname: Yeh fullname: Yeh, Wei-Chang email: yeh@ieee.org organization: Integration and Collaboration Laboratory, Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan – sequence: 2 givenname: Zhifeng surname: Hao fullname: Hao, Zhifeng organization: Schools of Mathematics and Big Data, Foshan University, Foshan, China – sequence: 3 givenname: Majid surname: Forghani-elahabad fullname: Forghani-elahabad, Majid organization: Center of Mathematics, Computation and Cognition - CMCC, Federal University of ABC - UFABC, Santo André, SP, Brazil – sequence: 4 givenname: Gai-Ge surname: Wang fullname: Wang, Gai-Ge organization: Department of Computer Science, Ocean University of China, Qingdao, China – sequence: 5 givenname: Yih-Lon surname: Lin fullname: Lin, Yih-Lon organization: Department of Computer Science and Information Engineering, Nation Yunlin University of Science & Technology, Yunlin, Taiwan |
| BookMark | eNp9kMlOwzAQhi1UJErhBThZ4pziJYsjcSlVWSQWCZWz5TgTcHDjYrtFfXvShhMHTiON_m-W7xSNOtcBQheUTCmh-VU79RDClBG2bxQpK47QmIqiTIjg-QiNSZnRRHBGTtBpCC0hJC2zYozaZ7cFi29Mp_wumdW1icZ1eOkB8My-O2_ixwo3zuNXsEZVxpq4w4utsht1SLoGz_ROW6Px08ZGE6KKgB-6HlkNiWeI385_hjN03Cgb4Py3TtDb7WI5v08eX-4e5rPHRHMmYsKBlxwaRSoiiKhzrlXKGa2ymjVllkHeAFQsz9MiK2mqVVmXOTQZF4oRqETNJ-hymLv27msDIcrWbXzXr5QsoznjglLap8SQ0t6F4KGR2sTDwdErYyUlcm9WtnJvVu7NysFsj7I_6NqbVe_vf-h6gKB_fWvAy6ANdBpq40FHWTvzH_4DelCVwQ |
| CitedBy_id | crossref_primary_10_3390_app12199514 crossref_primary_10_3390_app112210765 crossref_primary_10_1016_j_ress_2021_107757 crossref_primary_10_3390_app12146858 crossref_primary_10_1016_j_eswa_2022_118894 crossref_primary_10_1016_j_ress_2022_108509 crossref_primary_10_1016_j_ress_2022_108623 crossref_primary_10_1016_j_ress_2021_107950 crossref_primary_10_1016_j_ress_2022_108954 crossref_primary_10_1016_j_ress_2021_108167 crossref_primary_10_1016_j_ress_2024_109968 crossref_primary_10_1016_j_cie_2025_111255 crossref_primary_10_1016_j_ress_2021_108226 crossref_primary_10_1093_jcde_qwab079 crossref_primary_10_1016_j_ress_2024_110742 crossref_primary_10_1016_j_ress_2025_111722 crossref_primary_10_1109_JIOT_2024_3502696 crossref_primary_10_1016_j_ress_2022_108371 crossref_primary_10_1093_jcde_qwad021 crossref_primary_10_1109_TR_2024_3354817 |
| Cites_doi | 10.1109/TR.2007.911260 10.1109/TR.2011.2134310 10.1002/net.3230100206 10.1080/24725854.2018.1504358 10.1109/TR.2012.2207574 10.1016/S0925-5273(03)00180-4 10.1109/JSEN.2020.2965592 10.1016/j.ress.2019.106566 10.1080/07408170802322622 10.1016/j.ress.2005.08.002 10.1109/ACCESS.2019.2953996 10.1016/j.ress.2006.11.004 10.1109/TR.2011.2161030 10.1049/ip-map:20040410 10.1109/TR.2005.853444 10.1504/IJOR.2020.105764 10.1109/TR.2008.916871 10.1142/S0218539319500256 10.1080/24725854.2017.1351044 10.1016/j.ress.2005.12.006 10.3390/electronics9081207 10.1016/j.trpro.2018.11.001 10.1109/TNNLS.2016.2598562 10.1109/TR.2019.2901057 10.1016/j.jocs.2019.04.002 10.1109/TPWRS.2002.800873 10.1016/j.ress.2003.12.002 10.3390/app10238349 10.1109/TR.2018.2829081 10.1109/TR.2017.2771495 10.1109/TR.2019.2954894 10.1016/j.ress.2014.11.010 10.1016/j.ress.2018.04.006 10.1109/TR.2009.2026688 10.1109/TR.2010.2055931 10.1109/TR.2015.2430491 10.1109/TR.2013.2273038 10.1080/07408170500341270 10.1016/j.eswa.2009.09.070 10.1109/TR.2003.813162 10.1016/j.ress.2018.02.002 10.1109/TR.2016.2570552 10.1016/j.ress.2016.11.012 10.1016/S0951-8320(02)00173-4 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier Ltd Copyright Elsevier BV Jun 2021 |
| Copyright_xml | – notice: 2020 Elsevier Ltd – notice: Copyright Elsevier BV Jun 2021 |
| DBID | AAYXX CITATION 7ST 7TB 8FD C1K FR3 SOI |
| DOI | 10.1016/j.ress.2020.107427 |
| DatabaseName | CrossRef Environment Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Environmental Sciences and Pollution Management Engineering Research Database Environment Abstracts |
| DatabaseTitle | CrossRef Engineering Research Database Technology Research Database Mechanical & Transportation Engineering Abstracts Environment Abstracts Environmental Sciences and Pollution Management |
| DatabaseTitleList | Engineering Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1879-0836 |
| ExternalDocumentID | 10_1016_j_ress_2020_107427 S0951832020309121 |
| GroupedDBID | --K --M .~1 0R~ 123 1B1 1~. 1~5 29P 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN 9JO AABNK AACTN AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO ABEFU ABFNM ABJNI ABMAC ABMMH ABTAH ABWVN ABXDB ACDAQ ACGFS ACIWK ACNNM ACRLP ACRPL ADBBV ADEZE ADMUD ADNMO ADTZH AEBSH AECPX AEIPS AEKER AENEX AFJKZ AFRAH AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOMHK ASPBG AVARZ AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC BNPGV CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HVGLF HZ~ IHE J1W JJJVA KOM LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SES SET SEW SPCBC SSB SSH SSO SST SSZ T5K TN5 WUQ XPP ZMT ZY4 ~G- 9DU AAYWO AAYXX ACLOT ACVFH ADCNI AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP APXCP CITATION EFKBS EFLBG SPC ~HD 7ST 7TB 8FD AGCQF C1K FR3 SOI |
| ID | FETCH-LOGICAL-c328t-3e393efa0b0808d63ca4321b5d2f955e6feeb266475914ca9d96ef538a20eb8d3 |
| ISICitedReferencesCount | 26 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000663909400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0951-8320 |
| IngestDate | Wed Aug 13 04:19:29 EDT 2025 Sat Nov 29 07:06:50 EST 2025 Tue Nov 18 21:51:37 EST 2025 Sun Apr 06 06:54:38 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Universal generation function method (UGFM) Network reliability Binary-addition tree (BAT) algorithm Acyclic multistate information network (AMIN) |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c328t-3e393efa0b0808d63ca4321b5d2f955e6feeb266475914ca9d96ef538a20eb8d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2516238111 |
| PQPubID | 2045406 |
| ParticipantIDs | proquest_journals_2516238111 crossref_citationtrail_10_1016_j_ress_2020_107427 crossref_primary_10_1016_j_ress_2020_107427 elsevier_sciencedirect_doi_10_1016_j_ress_2020_107427 |
| PublicationCentury | 2000 |
| PublicationDate | June 2021 2021-06-00 20210601 |
| PublicationDateYYYYMMDD | 2021-06-01 |
| PublicationDate_xml | – month: 06 year: 2021 text: June 2021 |
| PublicationDecade | 2020 |
| PublicationPlace | Barking |
| PublicationPlace_xml | – name: Barking |
| PublicationTitle | Reliability engineering & system safety |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd Elsevier BV |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier BV |
| References | Forghani-elahabad, Kagan (bib0021) 2019; 33 IEEE Trans Reliab, vol. 67, no. 1, pp. 308–315, 2018. Levitin (bib0033) 2005 Wang, Billinton, Goel (bib0006) 2002; 17 Yeh (bib0001) 2004; 88 Zhang, Shao (bib0013) 2018; 67 Yeh, Lin, Chung (bib0014) 2010; 37 Yeh (bib0026) 2017; 49 Yeh, Bae, Huang (bib0019) 2015; 136 Forghani-elahabad, Kagan, Mahdavi-Amiri (bib0016) 2019; 191 Forghani-elahabad, Kagan (bib0018) 2019; 51 Bai, Zuo, Tian (bib0022) 2015; 64 Ramirez-Marquez, Coit, Tortorella (bib0028) 2006; 38 Song, Jia, Chen (bib0004) 2019; 7 Yeh (bib0048) 2020; 208 Yeh, Chu (bib0020) 2018; 176 Chakraborty, Goyal, Soh (bib0003) 2020; 20 Yeh (bib0037) 2012; 61 Yeh, Zuo (bib0015) 2019; 68 Ball (bib0046) 1980; 10 Su, Yeh (bib0047) 2020; 9 Forghani-elahabad, Mahdavi-Amiri, Kagan (bib0012) 2020; 37 no Yeh (bib0017) 2008; 57 Yeh (bib0036) 2008; 57 Yeh (bib0035) 2008; 41 Yeh (bib0038) 2013; 62 He, Chen, Zhao, Han, Zhou (bib0009) 2019 Yeh (bib0005) 2011; 60 Yeh (bib0023) 2019; 192 MPs for all Possible Yeh (bib0029) 2016; 65 Yeh, Cao, Jin (bib0045) 2012; 8 Chakraborty, Goyal, Mahapatra, Soh (bib0002) 2019; 69 Yeh (bib0043) 2009; 58 Levitin (bib0039) 2003; 52 Forghani-elahabad, Kagan (bib0025) 2019; 26 Lin, Tseng (bib0007) 2004; 151 Rodríguez-Sanz, Álvarez, Comendador, Valdés, Pérez-Castán, Godoy (bib0008) 2018; 33 Yeh (bib0050) 2020/09 W.-C. Yeh, “Fast Algorithm for Searching Lisnianski, Levitin (bib0031) 2003 Yeh, He (bib0042) 2010; 59 Yeh (bib0011) 2007; 92 Yeh (bib0027) 2016; 28 Yeh (bib0034) 2006; 91 Ramirez-Marquez, Coit (bib0030) 2005; 54 Yeh, Kuo (bib0049) 2020/11 Yeh (bib0010) 2008; 93 Levitin (bib0040) 2002; 78 Yeh, Yeh (bib0041) 2011; 60 Yeh (bib0044) 2017; 166 Levitin (bib0032) 2004; 84 Rodríguez-Sanz (10.1016/j.ress.2020.107427_bib0008) 2018; 33 Forghani-elahabad (10.1016/j.ress.2020.107427_bib0012) 2020; 37 no Su (10.1016/j.ress.2020.107427_bib0047) 2020; 9 Yeh (10.1016/j.ress.2020.107427_bib0019) 2015; 136 Lisnianski (10.1016/j.ress.2020.107427_bib0031) 2003 Yeh (10.1016/j.ress.2020.107427_bib0001) 2004; 88 Lin (10.1016/j.ress.2020.107427_bib0007) 2004; 151 Yeh (10.1016/j.ress.2020.107427_bib0037) 2012; 61 Ball (10.1016/j.ress.2020.107427_bib0046) 1980; 10 Levitin (10.1016/j.ress.2020.107427_bib0032) 2004; 84 He (10.1016/j.ress.2020.107427_bib0009) 2019 Yeh (10.1016/j.ress.2020.107427_bib0015) 2019; 68 Yeh (10.1016/j.ress.2020.107427_bib0049) 2020 Forghani-elahabad (10.1016/j.ress.2020.107427_bib0025) 2019; 26 Levitin (10.1016/j.ress.2020.107427_bib0039) 2003; 52 Ramirez-Marquez (10.1016/j.ress.2020.107427_bib0030) 2005; 54 Levitin (10.1016/j.ress.2020.107427_bib0040) 2002; 78 Yeh (10.1016/j.ress.2020.107427_bib0038) 2013; 62 Yeh (10.1016/j.ress.2020.107427_bib0020) 2018; 176 Forghani-elahabad (10.1016/j.ress.2020.107427_bib0021) 2019; 33 Ramirez-Marquez (10.1016/j.ress.2020.107427_bib0028) 2006; 38 Yeh (10.1016/j.ress.2020.107427_bib0041) 2011; 60 Yeh (10.1016/j.ress.2020.107427_bib0042) 2010; 59 Yeh (10.1016/j.ress.2020.107427_bib0048) 2020; 208 Levitin (10.1016/j.ress.2020.107427_bib0033) 2005 Song (10.1016/j.ress.2020.107427_bib0004) 2019; 7 Yeh (10.1016/j.ress.2020.107427_bib0011) 2007; 92 Wang (10.1016/j.ress.2020.107427_bib0006) 2002; 17 Yeh (10.1016/j.ress.2020.107427_bib0027) 2016; 28 Yeh (10.1016/j.ress.2020.107427_bib0010) 2008; 93 Yeh (10.1016/j.ress.2020.107427_bib0044) 2017; 166 Yeh (10.1016/j.ress.2020.107427_bib0036) 2008; 57 Yeh (10.1016/j.ress.2020.107427_bib0045) 2012; 8 Yeh (10.1016/j.ress.2020.107427_bib0035) 2008; 41 Zhang (10.1016/j.ress.2020.107427_bib0013) 2018; 67 Bai (10.1016/j.ress.2020.107427_bib0022) 2015; 64 Yeh (10.1016/j.ress.2020.107427_bib0050) 2020 Forghani-elahabad (10.1016/j.ress.2020.107427_bib0018) 2019; 51 Yeh (10.1016/j.ress.2020.107427_bib0043) 2009; 58 Yeh (10.1016/j.ress.2020.107427_bib0014) 2010; 37 10.1016/j.ress.2020.107427_bib0024 Yeh (10.1016/j.ress.2020.107427_bib0029) 2016; 65 Forghani-elahabad (10.1016/j.ress.2020.107427_bib0016) 2019; 191 Yeh (10.1016/j.ress.2020.107427_bib0017) 2008; 57 Yeh (10.1016/j.ress.2020.107427_bib0005) 2011; 60 Yeh (10.1016/j.ress.2020.107427_bib0034) 2006; 91 Chakraborty (10.1016/j.ress.2020.107427_bib0003) 2020; 20 Chakraborty (10.1016/j.ress.2020.107427_bib0002) 2019; 69 Yeh (10.1016/j.ress.2020.107427_bib0026) 2017; 49 Yeh (10.1016/j.ress.2020.107427_bib0023) 2019; 192 |
| References_xml | – volume: 49 start-page: 1078 year: 2017 end-page: 1085 ident: bib0026 article-title: Methodology for the reliability evaluation of the novel learning-effect multi-state flow network publication-title: IISE Trans – volume: 37 no start-page: 479 year: 2020 end-page: 490 ident: bib0012 article-title: On multi-state two separate minimal paths reliability problem with time and budget constraints publication-title: Int J Oper Res – volume: 57 start-page: 88 year: 2008 end-page: 93 ident: bib0017 article-title: A greedy branch-and-bound inclusion-exclusion algorithm for calculating the exact multi-state network reliability publication-title: IEEE Trans Reliab – volume: 136 start-page: 1 year: 2015 end-page: 7 ident: bib0019 article-title: A new cut-based algorithm for the multi-state flow network reliability problem publication-title: Reliab Eng Syst Saf – volume: 52 start-page: 231 year: 2003 end-page: 237 ident: bib0039 article-title: Reliability evaluation for acyclic transmission networks of multi-state elements with delays publication-title: IEEE Trans Reliab – volume: 10 start-page: 153 year: 1980 end-page: 165 ident: bib0046 article-title: Complexity of network reliability computations publication-title: Networks – volume: 166 start-page: 132 year: 2017 end-page: 137 ident: bib0044 article-title: Evaluation of the one-to-all-target-subsets reliability of a novel deterioration-effect acyclic multi-state information network publication-title: Reliab Eng Syst Saf – volume: 7 start-page: 167714 year: 2019 end-page: 167725 ident: bib0004 article-title: Sensitivity analysis of multi-state social network system based on MDD method publication-title: IEEE Access – volume: 28 start-page: 2822 year: 2016 end-page: 2825 ident: bib0027 article-title: A squeezed artificial neural network for the symbolic network reliability functions of binary-state networks publication-title: IEEE Trans Neur Netw Learn Syst – year: 2019 ident: bib0009 article-title: Mission reliability evaluation for fuzzy multistate manufacturing system based on an extended stochastic flow network publication-title: IEEE Trans Reliab, – year: 2020/09 ident: bib0050 article-title: Novel bounded binary-addition tree algorithm for binary-state network reliability problems publication-title: Reliab Eng Syst Saf – volume: 69 start-page: 382 year: 2019 end-page: 400 ident: bib0002 article-title: Minimal path-based reliability model for wireless sensor networks with multistate nodes publication-title: IEEE Trans Reliab – volume: 33 start-page: 355 year: 2018 end-page: 362 ident: bib0008 article-title: Air traffic management based on 4D trajectories: a reliability analysis using multi-state systems theory publication-title: Transp Res Procedia – volume: 38 start-page: 477 year: 2006 end-page: 488 ident: bib0028 article-title: A generalized multistate-based path vector approach to multistate two-terminal reliability publication-title: IIE Trans – volume: 65 start-page: 1263 year: 2016 end-page: 1270 ident: bib0029 article-title: New method in searching for all minimal paths for the directed acyclic network reliability problem publication-title: IEEE Trans Reliab – volume: 68 start-page: 999 year: 2019 end-page: 1008 ident: bib0015 article-title: A new subtraction-based algorithm for the d-MPs for all d problem publication-title: IEEE Trans Reliab – reference: ,” IEEE Trans Reliab, vol. 67, no. 1, pp. 308–315, 2018. – volume: 57 start-page: 94 year: 2008 end-page: 102 ident: bib0036 article-title: The extension of universal generating function method to search for all one-to-many d-minimal paths of acyclic multi-state-arc flow-conservation networks publication-title: IEEE Trans Reliab – volume: 93 start-page: 125 year: 2008 end-page: 136 ident: bib0010 article-title: A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability publication-title: Reliab Eng Syst Saf – volume: 26 year: 2019 ident: bib0025 article-title: Assessing reliability of multistate flow networks under cost constraint in terms of minimal cuts publication-title: Int J Reliab Qual Saf Eng – volume: 176 start-page: 209 year: 2018 end-page: 217 ident: bib0020 article-title: A novel multi-distribution multi-state flow network and its reliability optimization problem publication-title: Reliab Eng Syst Saf – volume: 41 start-page: 3 year: 2008 end-page: 11 ident: bib0035 article-title: A simple universal generating function method for estimating the reliability of general multi-state node networks publication-title: IIE Trans – volume: 33 start-page: 61 year: 2019 end-page: 67 ident: bib0021 article-title: An approximate approach for reliability evaluation of a multistate flow network in terms of minimal cuts publication-title: J Comput Sci – year: 2003 ident: bib0031 article-title: Multi-state system reliability: assessment, optimization and applications – volume: 67 start-page: 1249 year: 2018 end-page: 1260 ident: bib0013 article-title: A diameter-constrained approximation algorithm of multistate two-terminal reliability publication-title: IEEE Trans Reliab – volume: 61 start-page: 702 year: 2012 end-page: 709 ident: bib0037 article-title: A modified universal generating function algorithm for the acyclic binary-state network reliability publication-title: IEEE Trans Reliab – volume: 37 start-page: 3537 year: 2010 end-page: 3544 ident: bib0014 article-title: Performance analysis of cellular automata Monte Carlo Simulation for estimating network reliability publication-title: Expert Syst Appl – volume: 62 start-page: 628 year: 2013 end-page: 636 ident: bib0038 article-title: A novel cut-based universal generating function method publication-title: IEEE Trans Reliab – volume: 58 start-page: 476 year: 2009 end-page: 484 ident: bib0043 article-title: A convolution universal generating function method for evaluating the symbolic one-to-all-target-subset reliability function of acyclic multi-state information networks publication-title: IEEE Trans Reliab – volume: 208 start-page: 107448 year: 2020 ident: bib0048 article-title: Novel Binary-Addition Tree Algorithm (BAT) for Binary-State Network Reliability Problem – volume: 91 start-page: 800 year: 2006 end-page: 808 ident: bib0034 article-title: The k-out-of-n acyclic multistate-node networks reliability evaluation using the universal generating function method publication-title: Reliab Eng Syst Saf – volume: 8 start-page: 2001 year: 2012 end-page: 2014 ident: bib0045 article-title: A cellular automata hybrid quasi-random Monte Carlo simulation for estimating the one-to-all reliability of acyclic multi-state information networks publication-title: Int J Innov Comput Inform Control – volume: 9 start-page: 1207 year: 2020 ident: bib0047 article-title: Binary-addition tree algorithm-based resilience assessment for binary-state network problems publication-title: Electronics – volume: 20 start-page: 4992 year: 2020 end-page: 5003 ident: bib0003 article-title: On area coverage reliability of mobile wireless sensor networks with multistate nodes publication-title: IEEE Sensor J – year: 2020/11 ident: bib0049 article-title: Predicting and modeling wildfire propagation areas with BAT and maximum-state PageRank publication-title: Appl Sci – volume: 17 start-page: 549 year: 2002 end-page: 556 ident: bib0006 article-title: Unreliability cost assessment of an electric power system using reliability network equivalent approaches publication-title: IEEE Trans Power Syst – reference: -MPs for all Possible – volume: 78 start-page: 297 year: 2002 end-page: 305 ident: bib0040 article-title: Reliability of acyclic multi-state networks with constant transmission characteristics of lines publication-title: Reliab Eng Syst Saf – volume: 191 year: 2019 ident: bib0016 article-title: An MP-based approximation algorithm on reliability evaluation of multistate flow networks publication-title: Reliab Eng Syst Saf – volume: 60 start-page: 612 year: 2011 end-page: 621 ident: bib0005 article-title: A sequential decomposition method for estimating flow in a multi-commodity, multistate network publication-title: IEEE Trans Reliab – volume: 88 start-page: 73 year: 2004 end-page: 83 ident: bib0001 article-title: Multistate network reliability evaluation under the maintenance cost constraint publication-title: Int J Prod Econ – year: 2005 ident: bib0033 article-title: The universal generating function in reliability analysis and optimization – volume: 51 start-page: 547 year: 2019 end-page: 558 ident: bib0018 article-title: Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint publication-title: IISE Trans – reference: W.-C. Yeh, “Fast Algorithm for Searching – volume: 60 start-page: 470 year: 2011 end-page: 478 ident: bib0041 article-title: A novel label universal generating function method for evaluating the one-to-all-subsets general multistate information network reliability publication-title: IEEE Trans Reliab – volume: 151 start-page: 241 year: 2004 end-page: 248 ident: bib0007 article-title: Two-level, multistate Markov model for satellite propagation channels publication-title: IEE Proceed-Microw Antennas Propag – volume: 84 start-page: 285 year: 2004 end-page: 292 ident: bib0032 article-title: A universal generating function approach for the analysis of multi-state systems with dependent elements publication-title: Reliab Eng Syst Saf – volume: 64 start-page: 1015 year: 2015 end-page: 1023 ident: bib0022 article-title: Ordering heuristics for reliability evaluation of multistate networks publication-title: IEEE Trans Reliab – volume: 192 year: 2019 ident: bib0023 article-title: A novel boundary swarm optimization method for reliability redundancy allocation problems publication-title: Reliab Eng Syst Saf – volume: 59 start-page: 528 year: 2010 end-page: 538 ident: bib0042 article-title: A new universal generating function method for estimating the novel multiresource multistate information network reliability publication-title: IEEE Trans Reliab – volume: 54 start-page: 517 year: 2005 end-page: 529 ident: bib0030 article-title: Composite importance measures for multi-state systems with multi-state components publication-title: IEEE Trans Reliab – volume: 92 start-page: 260 year: 2007 end-page: 268 ident: bib0011 article-title: An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths publication-title: Reliab Eng Syst Saf – volume: 57 start-page: 94 issue: 1 year: 2008 ident: 10.1016/j.ress.2020.107427_bib0036 article-title: The extension of universal generating function method to search for all one-to-many d-minimal paths of acyclic multi-state-arc flow-conservation networks publication-title: IEEE Trans Reliab doi: 10.1109/TR.2007.911260 – volume: 60 start-page: 470 issue: 2 year: 2011 ident: 10.1016/j.ress.2020.107427_bib0041 article-title: A novel label universal generating function method for evaluating the one-to-all-subsets general multistate information network reliability publication-title: IEEE Trans Reliab doi: 10.1109/TR.2011.2134310 – volume: 10 start-page: 153 issue: 2 year: 1980 ident: 10.1016/j.ress.2020.107427_bib0046 article-title: Complexity of network reliability computations publication-title: Networks doi: 10.1002/net.3230100206 – volume: 51 start-page: 547 issue: 5 year: 2019 ident: 10.1016/j.ress.2020.107427_bib0018 article-title: Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint publication-title: IISE Trans doi: 10.1080/24725854.2018.1504358 – year: 2019 ident: 10.1016/j.ress.2020.107427_bib0009 article-title: Mission reliability evaluation for fuzzy multistate manufacturing system based on an extended stochastic flow network publication-title: IEEE Trans Reliab, – volume: 61 start-page: 702 issue: 3 year: 2012 ident: 10.1016/j.ress.2020.107427_bib0037 article-title: A modified universal generating function algorithm for the acyclic binary-state network reliability publication-title: IEEE Trans Reliab doi: 10.1109/TR.2012.2207574 – volume: 8 start-page: 2001 issue: 3 year: 2012 ident: 10.1016/j.ress.2020.107427_bib0045 article-title: A cellular automata hybrid quasi-random Monte Carlo simulation for estimating the one-to-all reliability of acyclic multi-state information networks publication-title: Int J Innov Comput Inform Control – volume: 88 start-page: 73 issue: 1 year: 2004 ident: 10.1016/j.ress.2020.107427_bib0001 article-title: Multistate network reliability evaluation under the maintenance cost constraint publication-title: Int J Prod Econ doi: 10.1016/S0925-5273(03)00180-4 – volume: 20 start-page: 4992 issue: 9 year: 2020 ident: 10.1016/j.ress.2020.107427_bib0003 article-title: On area coverage reliability of mobile wireless sensor networks with multistate nodes publication-title: IEEE Sensor J doi: 10.1109/JSEN.2020.2965592 – volume: 191 year: 2019 ident: 10.1016/j.ress.2020.107427_bib0016 article-title: An MP-based approximation algorithm on reliability evaluation of multistate flow networks publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2019.106566 – volume: 41 start-page: 3 issue: 1 year: 2008 ident: 10.1016/j.ress.2020.107427_bib0035 article-title: A simple universal generating function method for estimating the reliability of general multi-state node networks publication-title: IIE Trans doi: 10.1080/07408170802322622 – volume: 91 start-page: 800 issue: 7 year: 2006 ident: 10.1016/j.ress.2020.107427_bib0034 article-title: The k-out-of-n acyclic multistate-node networks reliability evaluation using the universal generating function method publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2005.08.002 – volume: 7 start-page: 167714 year: 2019 ident: 10.1016/j.ress.2020.107427_bib0004 article-title: Sensitivity analysis of multi-state social network system based on MDD method publication-title: IEEE Access doi: 10.1109/ACCESS.2019.2953996 – volume: 93 start-page: 125 issue: 1 year: 2008 ident: 10.1016/j.ress.2020.107427_bib0010 article-title: A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2006.11.004 – year: 2003 ident: 10.1016/j.ress.2020.107427_bib0031 – volume: 60 start-page: 612 issue: 3 year: 2011 ident: 10.1016/j.ress.2020.107427_bib0005 article-title: A sequential decomposition method for estimating flow in a multi-commodity, multistate network publication-title: IEEE Trans Reliab doi: 10.1109/TR.2011.2161030 – volume: 151 start-page: 241 issue: 3 year: 2004 ident: 10.1016/j.ress.2020.107427_bib0007 article-title: Two-level, multistate Markov model for satellite propagation channels publication-title: IEE Proceed-Microw Antennas Propag doi: 10.1049/ip-map:20040410 – volume: 54 start-page: 517 issue: 3 year: 2005 ident: 10.1016/j.ress.2020.107427_bib0030 article-title: Composite importance measures for multi-state systems with multi-state components publication-title: IEEE Trans Reliab doi: 10.1109/TR.2005.853444 – volume: 37 no start-page: 479 issue: 4 year: 2020 ident: 10.1016/j.ress.2020.107427_bib0012 article-title: On multi-state two separate minimal paths reliability problem with time and budget constraints publication-title: Int J Oper Res doi: 10.1504/IJOR.2020.105764 – volume: 57 start-page: 88 issue: 1 year: 2008 ident: 10.1016/j.ress.2020.107427_bib0017 article-title: A greedy branch-and-bound inclusion-exclusion algorithm for calculating the exact multi-state network reliability publication-title: IEEE Trans Reliab doi: 10.1109/TR.2008.916871 – volume: 26 issue: 05 year: 2019 ident: 10.1016/j.ress.2020.107427_bib0025 article-title: Assessing reliability of multistate flow networks under cost constraint in terms of minimal cuts publication-title: Int J Reliab Qual Saf Eng doi: 10.1142/S0218539319500256 – volume: 49 start-page: 1078 issue: 11 year: 2017 ident: 10.1016/j.ress.2020.107427_bib0026 article-title: Methodology for the reliability evaluation of the novel learning-effect multi-state flow network publication-title: IISE Trans doi: 10.1080/24725854.2017.1351044 – volume: 92 start-page: 260 issue: 2 year: 2007 ident: 10.1016/j.ress.2020.107427_bib0011 article-title: An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2005.12.006 – volume: 9 start-page: 1207 issue: 8 year: 2020 ident: 10.1016/j.ress.2020.107427_bib0047 article-title: Binary-addition tree algorithm-based resilience assessment for binary-state network problems publication-title: Electronics doi: 10.3390/electronics9081207 – volume: 33 start-page: 355 year: 2018 ident: 10.1016/j.ress.2020.107427_bib0008 article-title: Air traffic management based on 4D trajectories: a reliability analysis using multi-state systems theory publication-title: Transp Res Procedia doi: 10.1016/j.trpro.2018.11.001 – volume: 28 start-page: 2822 issue: 11 year: 2016 ident: 10.1016/j.ress.2020.107427_bib0027 article-title: A squeezed artificial neural network for the symbolic network reliability functions of binary-state networks publication-title: IEEE Trans Neur Netw Learn Syst doi: 10.1109/TNNLS.2016.2598562 – volume: 68 start-page: 999 issue: 3 year: 2019 ident: 10.1016/j.ress.2020.107427_bib0015 article-title: A new subtraction-based algorithm for the d-MPs for all d problem publication-title: IEEE Trans Reliab doi: 10.1109/TR.2019.2901057 – volume: 33 start-page: 61 year: 2019 ident: 10.1016/j.ress.2020.107427_bib0021 article-title: An approximate approach for reliability evaluation of a multistate flow network in terms of minimal cuts publication-title: J Comput Sci doi: 10.1016/j.jocs.2019.04.002 – volume: 17 start-page: 549 issue: 3 year: 2002 ident: 10.1016/j.ress.2020.107427_bib0006 article-title: Unreliability cost assessment of an electric power system using reliability network equivalent approaches publication-title: IEEE Trans Power Syst doi: 10.1109/TPWRS.2002.800873 – volume: 84 start-page: 285 issue: 3 year: 2004 ident: 10.1016/j.ress.2020.107427_bib0032 article-title: A universal generating function approach for the analysis of multi-state systems with dependent elements publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2003.12.002 – year: 2020 ident: 10.1016/j.ress.2020.107427_bib0049 article-title: Predicting and modeling wildfire propagation areas with BAT and maximum-state PageRank publication-title: Appl Sci doi: 10.3390/app10238349 – volume: 67 start-page: 1249 issue: 3 year: 2018 ident: 10.1016/j.ress.2020.107427_bib0013 article-title: A diameter-constrained approximation algorithm of multistate two-terminal reliability publication-title: IEEE Trans Reliab doi: 10.1109/TR.2018.2829081 – year: 2020 ident: 10.1016/j.ress.2020.107427_bib0050 article-title: Novel bounded binary-addition tree algorithm for binary-state network reliability problems publication-title: Reliab Eng Syst Saf – ident: 10.1016/j.ress.2020.107427_bib0024 doi: 10.1109/TR.2017.2771495 – volume: 69 start-page: 382 issue: 1 year: 2019 ident: 10.1016/j.ress.2020.107427_bib0002 article-title: Minimal path-based reliability model for wireless sensor networks with multistate nodes publication-title: IEEE Trans Reliab doi: 10.1109/TR.2019.2954894 – volume: 136 start-page: 1 year: 2015 ident: 10.1016/j.ress.2020.107427_bib0019 article-title: A new cut-based algorithm for the multi-state flow network reliability problem publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2014.11.010 – volume: 176 start-page: 209 year: 2018 ident: 10.1016/j.ress.2020.107427_bib0020 article-title: A novel multi-distribution multi-state flow network and its reliability optimization problem publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2018.04.006 – volume: 58 start-page: 476 issue: 3 year: 2009 ident: 10.1016/j.ress.2020.107427_bib0043 article-title: A convolution universal generating function method for evaluating the symbolic one-to-all-target-subset reliability function of acyclic multi-state information networks publication-title: IEEE Trans Reliab doi: 10.1109/TR.2009.2026688 – year: 2005 ident: 10.1016/j.ress.2020.107427_bib0033 – volume: 59 start-page: 528 issue: 3 year: 2010 ident: 10.1016/j.ress.2020.107427_bib0042 article-title: A new universal generating function method for estimating the novel multiresource multistate information network reliability publication-title: IEEE Trans Reliab doi: 10.1109/TR.2010.2055931 – volume: 64 start-page: 1015 issue: 3 year: 2015 ident: 10.1016/j.ress.2020.107427_bib0022 article-title: Ordering heuristics for reliability evaluation of multistate networks publication-title: IEEE Trans Reliab doi: 10.1109/TR.2015.2430491 – volume: 62 start-page: 628 issue: 3 year: 2013 ident: 10.1016/j.ress.2020.107427_bib0038 article-title: A novel cut-based universal generating function method publication-title: IEEE Trans Reliab doi: 10.1109/TR.2013.2273038 – volume: 38 start-page: 477 issue: 6 year: 2006 ident: 10.1016/j.ress.2020.107427_bib0028 article-title: A generalized multistate-based path vector approach to multistate two-terminal reliability publication-title: IIE Trans doi: 10.1080/07408170500341270 – volume: 208 start-page: 107448 year: 2020 ident: 10.1016/j.ress.2020.107427_bib0048 – volume: 37 start-page: 3537 issue: 5 year: 2010 ident: 10.1016/j.ress.2020.107427_bib0014 article-title: Performance analysis of cellular automata Monte Carlo Simulation for estimating network reliability publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2009.09.070 – volume: 52 start-page: 231 issue: 2 year: 2003 ident: 10.1016/j.ress.2020.107427_bib0039 article-title: Reliability evaluation for acyclic transmission networks of multi-state elements with delays publication-title: IEEE Trans Reliab doi: 10.1109/TR.2003.813162 – volume: 192 year: 2019 ident: 10.1016/j.ress.2020.107427_bib0023 article-title: A novel boundary swarm optimization method for reliability redundancy allocation problems publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2018.02.002 – volume: 65 start-page: 1263 issue: 3 year: 2016 ident: 10.1016/j.ress.2020.107427_bib0029 article-title: New method in searching for all minimal paths for the directed acyclic network reliability problem publication-title: IEEE Trans Reliab doi: 10.1109/TR.2016.2570552 – volume: 166 start-page: 132 year: 2017 ident: 10.1016/j.ress.2020.107427_bib0044 article-title: Evaluation of the one-to-all-target-subsets reliability of a novel deterioration-effect acyclic multi-state information network publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2016.11.012 – volume: 78 start-page: 297 issue: 3 year: 2002 ident: 10.1016/j.ress.2020.107427_bib0040 article-title: Reliability of acyclic multi-state networks with constant transmission characteristics of lines publication-title: Reliab Eng Syst Saf doi: 10.1016/S0951-8320(02)00173-4 |
| SSID | ssj0004957 |
| Score | 2.4550083 |
| Snippet | •An improved binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to... Acyclic multistate information network (AMIN), a variant of multistate information network (MIN) that is not dependent on the conservation laws of flow, plays... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 107427 |
| SubjectTerms | Acyclic multistate information network (AMIN) Algorithms Binary-addition tree (BAT) algorithm Conservation laws Local area networks Network reliability Reliability analysis Reliability engineering Social networks Social organization System reliability Universal generation function method (UGFM) Wireless networks |
| Title | Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks |
| URI | https://dx.doi.org/10.1016/j.ress.2020.107427 https://www.proquest.com/docview/2516238111 |
| Volume | 210 |
| WOSCitedRecordID | wos000663909400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-0836 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004957 issn: 0951-8320 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxELZCygEOiKfaUpAP9LRyte-1jwGSAiqBQwoRl5XXazeJQpKmIWr_Fr-Q8WOz2wgiOHBZRV7vQ54vs-PxfJ8ReiXKEHAkU8Ip83XqhhKa-gJmKZKnQgkRssJsNpH1-3Q4ZJ9brZ8VF2Y9zWYzen3NFv_V1NAGxtbU2X8w9-am0AC_wehwBLPD8a8M35-v5dR7bXi2pFOWpibLGyyl9DrTi_lyvBp9N8WFuhrZqnTfeN2N6LcJTcWN0OLXhp1rKEeeoy2ZHn1bOn7VDGybN5O1xqFBllWL9q64cqIjNklrEjpf5ZgYhkPtCk3y9ttorGTdegFdxqQ75SNeWFB-5JOqGF8vB1iXdcrH5FQ2Mxlho-LKptc2FJsvt9KUAQGvY9dupHXSNGNGVbvpxUNXHWv9cPDbr4NNVExOdCLjBN5AN2Wx1Sa4LcXd_5T3zs_O8kF3ODiOeotLovcp0-v5x9Fbi5k7aC_MEkbbaK_zvjv8ULNxmdWXrd7cUbVsVeH2o_8UDm0FBibaGTxED9w0BXcsvB6hlpw9Rvcb4pVP0MQADW8BDWug4Q3QMKAGN7CBa6DhucIOaLgGGm4ADVdAe4rOe93Bm3fE7dxBRBTSFYlkxCKpuF_AhISWaSR4HIVBkZShYkkiUyVlAaGhFpsMYsFZyVKp4NvLQ18WtIyeofZsPpP7CJcwTpmAaUYmkpgpn6oiCajIeKzizPfFAQqqAcyFk7XXu6tM86p-cZLrQc_1oOd20A-Qt7lmYUVddvZOKrvkLiy14WYOuNp53VFlxNz5BzifBKmOkoPgcPfp5-he_R85Qu3V8od8ge6KNZhj-dJh7hfmALgl |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Novel+Binary-Addition+Tree+Algorithm+for+Reliability+Evaluation+of+Acyclic+Multistate+Information+Networks&rft.jtitle=Reliability+engineering+%26+system+safety&rft.au=Yeh%2C+Wei-Chang&rft.au=Hao%2C+Zhifeng&rft.au=ghani-Elahabad%2C+Majid&rft.au=Wang%2C+Gai-Ge&rft.date=2021-06-01&rft.pub=Elsevier+BV&rft.issn=0951-8320&rft.eissn=1879-0836&rft.volume=210&rft.spage=1&rft_id=info:doi/10.1016%2Fj.ress.2020.107427&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0951-8320&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0951-8320&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0951-8320&client=summon |