A new exact solution algorithm for a novel generalized redundancy allocation problem
The traditional redundancy allocation problem (RAP) aims to determine a system structure that strikes an appropriate balance between series and parallel components and that maximizes reliability by using redundant components in parallel, thus satisfying resource consumption constraints. The RAP is a...
Uložené v:
| Vydané v: | Information sciences Ročník 408; s. 182 - 197 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.10.2017
|
| Predmet: | |
| ISSN: | 0020-0255, 1872-6291 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The traditional redundancy allocation problem (RAP) aims to determine a system structure that strikes an appropriate balance between series and parallel components and that maximizes reliability by using redundant components in parallel, thus satisfying resource consumption constraints. The RAP is a well-known NP-hard problem and has been an active area of research for the past four decades. By extending the series–parallel structure to a more general network structure, this paper proposes a novel RAP called the generalized RAP (GRAP). To reduce the computational burden in solving this intractable GRAP, a new algorithm, called the hybrid swarm optimization (HSO), is proposed. The HSO combines concepts from simplified swarm optimization (SSO), particle swarm optimization (PSO), simulated annealing, and network reliability methods. The paper presents designed experiments and computational studies that demonstrate the potential of using the proposed HSO for the GRAP instead of using the genetic algorithm, PSO, or SSO. |
|---|---|
| AbstractList | The traditional redundancy allocation problem (RAP) aims to determine a system structure that strikes an appropriate balance between series and parallel components and that maximizes reliability by using redundant components in parallel, thus satisfying resource consumption constraints. The RAP is a well-known NP-hard problem and has been an active area of research for the past four decades. By extending the series–parallel structure to a more general network structure, this paper proposes a novel RAP called the generalized RAP (GRAP). To reduce the computational burden in solving this intractable GRAP, a new algorithm, called the hybrid swarm optimization (HSO), is proposed. The HSO combines concepts from simplified swarm optimization (SSO), particle swarm optimization (PSO), simulated annealing, and network reliability methods. The paper presents designed experiments and computational studies that demonstrate the potential of using the proposed HSO for the GRAP instead of using the genetic algorithm, PSO, or SSO. |
| Author | Yeh, Wei-Chang |
| 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 |
| BookMark | eNp9kL1uwjAUha2KSgXaB-jmF0h67SR2ok4I9U9C6kJny7FvqFGwkRNo6dM3QKcOTGc539U934SMfPBIyD2DlAETD-vU-S7lwGQKeQqsuiJjVkqeCF6xERkDcEiAF8UNmXTdGgByKcSYLGfU4xfFb2162oV217vgqW5XIbr-c0ObEKmmPuyxpSv0GHXrftDSiHbnrfbmMJTbYPSJ28ZQt7i5JdeNbju8-8sp-Xh-Ws5fk8X7y9t8tkgMr2SfVFlZZwVWkLHGGGm1tFBbIUTGC1tiwwSwzALnuqkrPZRKg7oGm6PMINM8mxJ2vmti6LqIjdpGt9HxoBiooxa1VoMWddSiIFeDloGR_xjj-tP3fdSuvUg-nkkcJu0dRtUZh96gdRFNr2xwF-hfysWAyA |
| CitedBy_id | crossref_primary_10_1002_qre_2500 crossref_primary_10_1016_j_ress_2024_110265 crossref_primary_10_1016_j_ress_2024_110441 crossref_primary_10_1177_1748006X251338301 crossref_primary_10_3390_technologies10030073 crossref_primary_10_3390_app12146858 crossref_primary_10_3390_electronics13122242 crossref_primary_10_1109_ACCESS_2020_2995771 crossref_primary_10_1016_j_ress_2021_108134 crossref_primary_10_1016_j_ress_2025_110948 crossref_primary_10_1016_j_ress_2022_108795 crossref_primary_10_1287_ijoc_2024_0842 crossref_primary_10_1109_ACCESS_2020_3018860 crossref_primary_10_1109_TII_2017_2786782 crossref_primary_10_1093_jcde_qwad021 crossref_primary_10_1093_jcde_qwae062 crossref_primary_10_1016_j_swevo_2019_100562 crossref_primary_10_3390_app122010595 crossref_primary_10_1155_2021_9932292 crossref_primary_10_3390_app112210765 crossref_primary_10_1016_j_ress_2021_107917 crossref_primary_10_1016_j_eswa_2022_116696 crossref_primary_10_1016_j_ress_2021_108167 crossref_primary_10_1016_j_asoc_2019_105582 crossref_primary_10_3390_app13042077 crossref_primary_10_1016_j_ress_2019_106703 crossref_primary_10_1080_00949655_2024_2383722 crossref_primary_10_1088_1742_6596_1828_1_012156 crossref_primary_10_3390_en11092385 crossref_primary_10_1016_j_ress_2023_109471 crossref_primary_10_1109_ACCESS_2019_2953180 crossref_primary_10_3390_app10238349 |
| Cites_doi | 10.1016/j.ins.2016.06.020 10.1109/TR.2007.903290 10.1016/j.ins.2016.01.027 10.1109/TSMCA.2006.889476 10.1126/science.220.4598.671 10.1016/j.ress.2003.10.010 10.1016/j.ress.2015.06.002 10.1016/j.ress.2016.07.025 10.1016/0143-8174(87)90050-3 10.1109/TR.2008.916871 10.1109/TR.2008.2006293 10.1016/S0360-8352(02)00186-9 10.1109/24.510811 10.1016/0951-8320(88)90122-6 10.1016/j.cor.2012.02.002 10.1016/j.ins.2015.01.020 10.1049/esej:20010106 10.1016/j.future.2012.03.005 10.1108/13552510610705928 10.1109/TR.1968.5217517 10.1080/07408170304422 10.1016/0167-6377(92)90008-Q 10.1016/j.knosys.2014.03.011 10.1016/j.cor.2010.10.028 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier Inc. |
| Copyright_xml | – notice: 2017 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ins.2017.04.019 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Library & Information Science |
| EISSN | 1872-6291 |
| EndPage | 197 |
| ExternalDocumentID | 10_1016_j_ins_2017_04_019 S0020025517306643 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ UHS WH7 WUQ XPP YYP ZMT ZY4 ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-938b35e9031fcc7da7d0bd666325d8ef16013d022afb9a31f8ceab0d4e7303a23 |
| ISICitedReferencesCount | 34 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000403126200012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0255 |
| IngestDate | Sat Nov 29 06:25:03 EST 2025 Tue Nov 18 22:19:51 EST 2025 Fri Feb 23 02:33:58 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Swarm intelligence Soft computing Reliability Redundancy allocation problem (RAP) |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-938b35e9031fcc7da7d0bd666325d8ef16013d022afb9a31f8ceab0d4e7303a23 |
| PageCount | 16 |
| ParticipantIDs | crossref_primary_10_1016_j_ins_2017_04_019 crossref_citationtrail_10_1016_j_ins_2017_04_019 elsevier_sciencedirect_doi_10_1016_j_ins_2017_04_019 |
| PublicationCentury | 2000 |
| PublicationDate | October 2017 2017-10-00 |
| PublicationDateYYYYMMDD | 2017-10-01 |
| PublicationDate_xml | – month: 10 year: 2017 text: October 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | Information sciences |
| PublicationYear | 2017 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Ramirez-Marquez, Coit (bib0017) 2004; 83 Kennedy, Eberhard, Shi (bib0014) 2001 Coit, Smith (bib0007) 1996; 45 Jiang, Yeh, Hao, Yang (bib0035) 2016; 369 Chern (bib0016) 1992; 11 Yeh, Hsieh (bib0030) 2011; 38 Sharma (bib0021) 1996 Yeh, Wei (bib0029) 2012; 28 Yeh (bib0025) 2007; 56 W.C. Yeh, “Study on quickest path networks with dependent components and apply to RAP”, 2008/08/01∼2011/07/31, NSC97-2221-E-007-099-MY3, Multiyear Research Project, Distinguished Scholars Research Project granted by National Science Council, Taiwan. Levitin (bib0008) 2005 Yeh (bib0028) 2014; 64 Kirkpatrick, Gelatt, Vecchi (bib0019) 1983; 220 Yeh (bib0031) 2008 Yeh (bib0026) 2008; 57 Ouyang, Gao, Li, Kong (bib0009) 2015; 305 Ekelof (bib0018) 2001; 10 Yeh (bib0027) 2008; 57 Kuo, Wan (bib0033) 2007; 37 Fyffe, Hines, Lee (bib0005) 1968; R-17 Colbourn (bib0002) 1987 Aven (bib0023) 1988; 21 Kim, Bae, Park (bib0010) 2006; 12 Aven (bib0022) 1987; 18 . Hollander, Wolfe (bib0015) 1999 Kulturel-Konak, Smith, Coit (bib0020) 2003; 35 Huang, Lin, Yeng (bib0001) 2016; 340-341 Hsieh (bib0034) 2003; 44 Shier (bib0006) 1991 Hsieh, Yeh (bib0024) 2012; 39 Huang (bib0003) 2015; 142 Lai, Yeh (bib0004) 2016; 156 Kennedy, Eberhard (bib0013) 1995 Hsieh (10.1016/j.ins.2017.04.019_bib0034) 2003; 44 Hollander (10.1016/j.ins.2017.04.019_bib0015) 1999 Colbourn (10.1016/j.ins.2017.04.019_bib0002) 1987 Kim (10.1016/j.ins.2017.04.019_bib0010) 2006; 12 Ouyang (10.1016/j.ins.2017.04.019_bib0009) 2015; 305 Yeh (10.1016/j.ins.2017.04.019_bib0028) 2014; 64 Ramirez-Marquez (10.1016/j.ins.2017.04.019_bib0017) 2004; 83 Yeh (10.1016/j.ins.2017.04.019_bib0026) 2008; 57 Yeh (10.1016/j.ins.2017.04.019_sbref0029) 2008 10.1016/j.ins.2017.04.019_bib0011 Lai (10.1016/j.ins.2017.04.019_bib0004) 2016; 156 10.1016/j.ins.2017.04.019_bib0012 Hsieh (10.1016/j.ins.2017.04.019_bib0024) 2012; 39 10.1016/j.ins.2017.04.019_bib0032 Kennedy (10.1016/j.ins.2017.04.019_bib0013) 1995 Chern (10.1016/j.ins.2017.04.019_bib0016) 1992; 11 Levitin (10.1016/j.ins.2017.04.019_bib0008) 2005 Coit (10.1016/j.ins.2017.04.019_bib0007) 1996; 45 Yeh (10.1016/j.ins.2017.04.019_bib0027) 2008; 57 Aven (10.1016/j.ins.2017.04.019_bib0023) 1988; 21 Huang (10.1016/j.ins.2017.04.019_bib0003) 2015; 142 Kulturel-Konak (10.1016/j.ins.2017.04.019_bib0020) 2003; 35 Jiang (10.1016/j.ins.2017.04.019_bib0035) 2016; 369 Fyffe (10.1016/j.ins.2017.04.019_bib0005) 1968; R-17 Shier (10.1016/j.ins.2017.04.019_bib0006) 1991 Yeh (10.1016/j.ins.2017.04.019_bib0030) 2011; 38 Kuo (10.1016/j.ins.2017.04.019_bib0033) 2007; 37 Ekelof (10.1016/j.ins.2017.04.019_bib0018) 2001; 10 Kirkpatrick (10.1016/j.ins.2017.04.019_bib0019) 1983; 220 Huang (10.1016/j.ins.2017.04.019_bib0001) 2016; 340-341 Yeh (10.1016/j.ins.2017.04.019_bib0025) 2007; 56 Kennedy (10.1016/j.ins.2017.04.019_bib0014) 2001 Aven (10.1016/j.ins.2017.04.019_bib0022) 1987; 18 Yeh (10.1016/j.ins.2017.04.019_bib0029) 2012; 28 Sharma (10.1016/j.ins.2017.04.019_bib0021) 1996 |
| References_xml | – volume: 45 start-page: 254 year: 1996 end-page: 260 ident: bib0007 article-title: Reliability optimization of series-parallel systems using a genetic algorithm publication-title: IEEE Trans. Reliab. – volume: 39 start-page: 2688 year: 2012 end-page: 2704 ident: bib0024 article-title: Penalty guided bees search for redundancy allocation problem with a mix of components in series-parallel systems publication-title: Comput. Oper. Res. – volume: 38 start-page: 1465 year: 2011 end-page: 1473 ident: bib0030 article-title: Solving reliability redundancy allocation problems using an artificial bee colony algorithm publication-title: Comput. Oper. Res. – volume: 64 start-page: 1 year: 2014 end-page: 12 ident: bib0028 article-title: Orthogonal simplified swarm optimization for the series–parallel redundancy allocation problem with a mix of components publication-title: Knowl.-Based Syst. – volume: R-17 start-page: 64 year: 1968 end-page: 69 ident: bib0005 article-title: System reliability allocation and a computation algorithm publication-title: IEEE Trans. Reliab. – volume: 18 start-page: 35 year: 1987 end-page: 44 ident: bib0022 article-title: Availability evaluation of oil/gas production and transportation systems publication-title: Reliab. Eng. – year: 2005 ident: bib0008 article-title: The Universal Generating Function in Reliability Analysis and Optimization – volume: 21 start-page: 215 year: 1988 end-page: 223 ident: bib0023 article-title: Some considerations on reliability theory and its applications publication-title: Reliab. Eng. Syst. Saf. – year: 1999 ident: bib0015 article-title: Nonparametric Statistical Methods – volume: 44 start-page: 91 year: 2003 end-page: 103 ident: bib0034 article-title: A linear approximation for redundant reliability problems with multiple component choices publication-title: Comput. Ind. Eng. – start-page: 1942 year: 1995 end-page: 1948 ident: bib0013 article-title: Particle swarm optimization publication-title: Proceedings of IEEE International Conference on Neural Networks. Publishing, Piscataway, NJ, USA – volume: 305 start-page: 14 year: 2015 end-page: 55 ident: bib0009 article-title: Improved novel global harmony search with a new relaxation method for reliability optimization problems publication-title: Inf. Sci. – volume: 340-341 start-page: 321 year: 2016 end-page: 336 ident: bib0001 article-title: Routing scheme of a multi‐state computer network employing a retransmission mechanism within a time threshold publication-title: Inf. Sci. – year: 1987 ident: bib0002 article-title: The Combinatorics of Network Reliability – volume: 35 start-page: 515 year: 2003 end-page: 526 ident: bib0020 article-title: Efficiently solving the redundancy allocation problem using Tabu search publication-title: IIE Trans. – volume: 57 start-page: 88 year: 2008 end-page: 93 ident: bib0027 article-title: A greedy branch-and-bound inclusion-exclusion algorithm for calculating the exact multi-state network reliability publication-title: IEEE Trans. Reliab. – volume: 142 start-page: 221 year: 2015 end-page: 230 ident: bib0003 article-title: A particle-based simplified swarm optimization algorithm for reliability redundancy allocation problems publication-title: Reliab. Eng. Syst. Saf. – year: 1996 ident: bib0021 article-title: Applied Multivariate Techniques – reference: W.C. Yeh, “Study on quickest path networks with dependent components and apply to RAP”, 2008/08/01∼2011/07/31, NSC97-2221-E-007-099-MY3, Multiyear Research Project, Distinguished Scholars Research Project granted by National Science Council, Taiwan. – volume: 37 start-page: 143 year: 2007 end-page: 156 ident: bib0033 article-title: Recent advances in optimal reliability allocation publication-title: IEEE Trans. Syst., Man Cybern, Part A – volume: 10 start-page: 37 year: 2001 end-page: 40 ident: bib0018 article-title: The genesis of the wheatstone bridge publication-title: Eng. Sci. Educ. J. – year: 2001 ident: bib0014 article-title: Swarm Intelligence – start-page: 117 year: 2008 end-page: 126 ident: bib0031 article-title: A simple hybrid particle swarm optimization publication-title: Advances in Evolutionary Algorithms – year: 1991 ident: bib0006 article-title: Network Reliability and Algebraic Structures – reference: . – volume: 156 start-page: 148 year: 2016 end-page: 158 ident: bib0004 article-title: Two-stage simplified swarm optimization for the redundancy allocation problem in a multi-state bridge system publication-title: Reliab. Eng. Syst. Saf. – volume: 369 start-page: 171 year: 2016 end-page: 183 ident: bib0035 article-title: A cooperative honey bee mating algorithm and its application in multi-threshold image segmentation publication-title: Inf. Sci. – volume: 220 start-page: 671 year: 1983 end-page: 680 ident: bib0019 article-title: Optimization by simulated annealing publication-title: Science – volume: 56 start-page: 488 year: 2007 end-page: 494 ident: bib0025 article-title: A simple heuristic algorithm for generating all minimal paths publication-title: IEEE Trans. Reliab. – volume: 11 start-page: 309 year: 1992 end-page: 315 ident: bib0016 article-title: On the computational complexity of reliability redundancy allocation in a series system publication-title: Oper. Res. Lett. – volume: 28 start-page: 989 year: 2012 end-page: 1002 ident: bib0029 article-title: “Economic-based resource allocation for reliable grid-computing service based on grid bank publication-title: Future Gener. Comput. Syst.-Int. J. Grid Comput.-Theory Methods Appl. – volume: 57 start-page: 581 year: 2008 end-page: 588 ident: bib0026 article-title: A fast algorithm for searching all multi-state minimal cuts publication-title: IEEE Trans. Reliab. – volume: 12 start-page: 354 year: 2006 end-page: 363 ident: bib0010 article-title: Reliability-redundancy optimization using simulated annealing algorithms publication-title: J. Qual. Maint. Eng. – volume: 83 start-page: 341 year: 2004 end-page: 349 ident: bib0017 article-title: A heuristic for solving the redundancy allocation problem for multistate series-parallel systems publication-title: Reliab. Eng. Syst. Saf. – volume: 369 start-page: 171 year: 2016 ident: 10.1016/j.ins.2017.04.019_bib0035 article-title: A cooperative honey bee mating algorithm and its application in multi-threshold image segmentation publication-title: Inf. Sci. doi: 10.1016/j.ins.2016.06.020 – start-page: 1942 year: 1995 ident: 10.1016/j.ins.2017.04.019_bib0013 article-title: Particle swarm optimization – volume: 56 start-page: 488 issue: 3 year: 2007 ident: 10.1016/j.ins.2017.04.019_bib0025 article-title: A simple heuristic algorithm for generating all minimal paths publication-title: IEEE Trans. Reliab. doi: 10.1109/TR.2007.903290 – year: 2001 ident: 10.1016/j.ins.2017.04.019_bib0014 – ident: 10.1016/j.ins.2017.04.019_bib0032 – volume: 340-341 start-page: 321 year: 2016 ident: 10.1016/j.ins.2017.04.019_bib0001 article-title: Routing scheme of a multi‐state computer network employing a retransmission mechanism within a time threshold publication-title: Inf. Sci. doi: 10.1016/j.ins.2016.01.027 – volume: 37 start-page: 143 issue: 2 year: 2007 ident: 10.1016/j.ins.2017.04.019_bib0033 article-title: Recent advances in optimal reliability allocation publication-title: IEEE Trans. Syst., Man Cybern, Part A doi: 10.1109/TSMCA.2006.889476 – ident: 10.1016/j.ins.2017.04.019_bib0011 – year: 1999 ident: 10.1016/j.ins.2017.04.019_bib0015 – volume: 220 start-page: 671 year: 1983 ident: 10.1016/j.ins.2017.04.019_bib0019 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 83 start-page: 341 issue: 3 year: 2004 ident: 10.1016/j.ins.2017.04.019_bib0017 article-title: A heuristic for solving the redundancy allocation problem for multistate series-parallel systems publication-title: Reliab. Eng. Syst. Saf. doi: 10.1016/j.ress.2003.10.010 – volume: 142 start-page: 221 year: 2015 ident: 10.1016/j.ins.2017.04.019_bib0003 article-title: A particle-based simplified swarm optimization algorithm for reliability redundancy allocation problems publication-title: Reliab. Eng. Syst. Saf. doi: 10.1016/j.ress.2015.06.002 – volume: 156 start-page: 148 year: 2016 ident: 10.1016/j.ins.2017.04.019_bib0004 article-title: Two-stage simplified swarm optimization for the redundancy allocation problem in a multi-state bridge system publication-title: Reliab. Eng. Syst. Saf. doi: 10.1016/j.ress.2016.07.025 – volume: 18 start-page: 35 issue: 1 year: 1987 ident: 10.1016/j.ins.2017.04.019_bib0022 article-title: Availability evaluation of oil/gas production and transportation systems publication-title: Reliab. Eng. doi: 10.1016/0143-8174(87)90050-3 – volume: 57 start-page: 88 issue: 1 year: 2008 ident: 10.1016/j.ins.2017.04.019_bib0027 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 – year: 2005 ident: 10.1016/j.ins.2017.04.019_bib0008 – volume: 57 start-page: 581 issue: 4 year: 2008 ident: 10.1016/j.ins.2017.04.019_bib0026 article-title: A fast algorithm for searching all multi-state minimal cuts publication-title: IEEE Trans. Reliab. doi: 10.1109/TR.2008.2006293 – volume: 44 start-page: 91 issue: 1 year: 2003 ident: 10.1016/j.ins.2017.04.019_bib0034 article-title: A linear approximation for redundant reliability problems with multiple component choices publication-title: Comput. Ind. Eng. doi: 10.1016/S0360-8352(02)00186-9 – year: 1991 ident: 10.1016/j.ins.2017.04.019_bib0006 – volume: 45 start-page: 254 issue: 2 year: 1996 ident: 10.1016/j.ins.2017.04.019_bib0007 article-title: Reliability optimization of series-parallel systems using a genetic algorithm publication-title: IEEE Trans. Reliab. doi: 10.1109/24.510811 – volume: 21 start-page: 215 issue: 3 year: 1988 ident: 10.1016/j.ins.2017.04.019_bib0023 article-title: Some considerations on reliability theory and its applications publication-title: Reliab. Eng. Syst. Saf. doi: 10.1016/0951-8320(88)90122-6 – ident: 10.1016/j.ins.2017.04.019_bib0012 – volume: 39 start-page: 2688 issue: 11 year: 2012 ident: 10.1016/j.ins.2017.04.019_bib0024 article-title: Penalty guided bees search for redundancy allocation problem with a mix of components in series-parallel systems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.02.002 – volume: 305 start-page: 14 year: 2015 ident: 10.1016/j.ins.2017.04.019_bib0009 article-title: Improved novel global harmony search with a new relaxation method for reliability optimization problems publication-title: Inf. Sci. doi: 10.1016/j.ins.2015.01.020 – year: 1987 ident: 10.1016/j.ins.2017.04.019_bib0002 – volume: 10 start-page: 37 issue: 1 year: 2001 ident: 10.1016/j.ins.2017.04.019_bib0018 article-title: The genesis of the wheatstone bridge publication-title: Eng. Sci. Educ. J. doi: 10.1049/esej:20010106 – year: 1996 ident: 10.1016/j.ins.2017.04.019_bib0021 – volume: 28 start-page: 989 issue: 7 year: 2012 ident: 10.1016/j.ins.2017.04.019_bib0029 article-title: “Economic-based resource allocation for reliable grid-computing service based on grid bank publication-title: Future Gener. Comput. Syst.-Int. J. Grid Comput.-Theory Methods Appl. doi: 10.1016/j.future.2012.03.005 – volume: 12 start-page: 354 issue: 4 year: 2006 ident: 10.1016/j.ins.2017.04.019_bib0010 article-title: Reliability-redundancy optimization using simulated annealing algorithms publication-title: J. Qual. Maint. Eng. doi: 10.1108/13552510610705928 – volume: R-17 start-page: 64 issue: 2 year: 1968 ident: 10.1016/j.ins.2017.04.019_bib0005 article-title: System reliability allocation and a computation algorithm publication-title: IEEE Trans. Reliab. doi: 10.1109/TR.1968.5217517 – volume: 35 start-page: 515 issue: 6 year: 2003 ident: 10.1016/j.ins.2017.04.019_bib0020 article-title: Efficiently solving the redundancy allocation problem using Tabu search publication-title: IIE Trans. doi: 10.1080/07408170304422 – volume: 11 start-page: 309 issue: 5 year: 1992 ident: 10.1016/j.ins.2017.04.019_bib0016 article-title: On the computational complexity of reliability redundancy allocation in a series system publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(92)90008-Q – start-page: 117 year: 2008 ident: 10.1016/j.ins.2017.04.019_sbref0029 article-title: A simple hybrid particle swarm optimization – volume: 64 start-page: 1 year: 2014 ident: 10.1016/j.ins.2017.04.019_bib0028 article-title: Orthogonal simplified swarm optimization for the series–parallel redundancy allocation problem with a mix of components publication-title: Knowl.-Based Syst. doi: 10.1016/j.knosys.2014.03.011 – volume: 38 start-page: 1465 issue: 11 year: 2011 ident: 10.1016/j.ins.2017.04.019_bib0030 article-title: Solving reliability redundancy allocation problems using an artificial bee colony algorithm publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2010.10.028 |
| SSID | ssj0004766 |
| Score | 2.386462 |
| Snippet | The traditional redundancy allocation problem (RAP) aims to determine a system structure that strikes an appropriate balance between series and parallel... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 182 |
| SubjectTerms | Redundancy allocation problem (RAP) Reliability Soft computing Swarm intelligence |
| Title | A new exact solution algorithm for a novel generalized redundancy allocation problem |
| URI | https://dx.doi.org/10.1016/j.ins.2017.04.019 |
| Volume | 408 |
| WOSCitedRecordID | wos000403126200012&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: 1872-6291 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004766 issn: 0020-0255 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdg48AOCAaIwYZ8mDgQWcqHE8fHCm0ChKYdiuhOkR070KmkU9dNFX897_mjzRggQOJiVWncRH6_Pv_e8_sg5BAIm6qqUrNUWs04h0HnvGRZh3Sks13buSKuH8TJST2ZyNPQ5u7StRMQfV-vVvLiv4oaroGwMXX2L8S9_lG4AJ9B6DCC2GH8I8GPsEt4YleY_BiflKjZ5_liuvzy1UdNJv382s6wfTK6pKbfLOawYD4Z6toEz-K9Jy8J_WaGFDYkMLmvw_655uVn1nlpPtkpc2kLQ58C7FMxOi04umKyy41YTGSWDE0Qv3V4fVmLnFW5b7gVFSpP64FKzHxzobC7Zj4a95bi9j6Ec7A2sIZ6Jlz92aBMb9bDxuNlZwlloJwqIFR3yXYuSglaeXv07mjyfpMWK_xRdXzveKjtwvt-eNDPacmAaowfkgfBRqAjL9tH5I7td8nOoHLkLjkI-Sb0FR3IgwZN_ZiMRxRQQB0KaEQBXaOAwhSqqEMBHaCAblBANyigAQVPyMfjo_Gbtyw00GBtLsWSyaLWRWklKO6ubYVRwqTagMFa5KWpbZeBNV4YYHGq01LBTXVrlU4Nt7C0hcqLp2Srn_f2GaGl1p3GnkYyM7xSpeJGF0B0DB7dAaPZI2lcv6YN1eWxycmsiWGE5w0seYNL3qS8gSXfI6_XUy58aZXf3cyjUJqAbc_5GkDQr6c9_7dpL8j9zd9in2wtF1f2gNxrr5fTy8XLgLPvcRuI2w |
| 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=A+new+exact+solution+algorithm+for+a+novel+generalized+redundancy+allocation+problem&rft.jtitle=Information+sciences&rft.au=Yeh%2C+Wei-Chang&rft.date=2017-10-01&rft.pub=Elsevier+Inc&rft.issn=0020-0255&rft.eissn=1872-6291&rft.volume=408&rft.spage=182&rft.epage=197&rft_id=info:doi/10.1016%2Fj.ins.2017.04.019&rft.externalDocID=S0020025517306643 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |