{"id":"https://openalex.org/W2185354564","doi":null,"title":"AN EFFICIENT HEURISTIC ALGORITHM FOR DETERMINING OPTIMAL REDUNDANCY ALLOCATION OF COMPLEX NETWORKS","display_name":"AN EFFICIENT HEURISTIC ALGORITHM FOR DETERMINING OPTIMAL REDUNDANCY ALLOCATION OF COMPLEX NETWORKS","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2185354564","mag":"2185354564"},"language":"en","primary_location":{"id":"mag:2185354564","doi":null,"is_oa":true,"landing_page_url":"https://cyberleninka.ru/article/n/an-efficient-heuristic-algorithm-for-determining-optimal-redundancy-allocation-of-complex-networks","pdf_url":null,"source":{"id":"https://openalex.org/S4306525691","display_name":"Reliability: Theory & Applications","issn_l":"1932-2321","issn":["1932-2321"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-20","russia-white-list-3"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Reliability: Theory & Applications","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://cyberleninka.ru/article/n/an-efficient-heuristic-algorithm-for-determining-optimal-redundancy-allocation-of-complex-networks","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066855040","display_name":"Pardeep Kumar","orcid":"https://orcid.org/0000-0003-3755-1837","observed_orcids":["https://orcid.org/0000-0003-3755-1837"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pardeep Kumar","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3755-1837","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033453212","display_name":"Devendra Kumar Chaturvedi","orcid":"https://orcid.org/0000-0002-4837-2570","observed_orcids":["https://orcid.org/0000-0002-4837-2570"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. K. Chaturvedi","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4837-2570","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108061122","display_name":"Gobind Lal Pahuja","orcid":"https://orcid.org/0000-0003-2442-3668","observed_orcids":["https://orcid.org/0000-0003-2442-3668"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. L. Pahuja","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"5","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11941","display_name":"Power System Reliability and Maintenance","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/redundancy-allocation-problem","display_name":"redundancy allocation","score":0.9110000133514404},{"id":"https://openalex.org/keywords/complex-networks","display_name":"complex networks","score":0.9269999861717224},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.9670000076293945},{"id":"https://openalex.org/keywords/network-reliability","display_name":"network reliability","score":0.7149999737739563},{"id":"https://openalex.org/keywords/iterative-optimization","display_name":"iterative optimization","score":0.6499999761581421},{"id":"https://openalex.org/keywords/component-availability","display_name":"component availability","score":0.4309999942779541},{"id":"https://openalex.org/keywords/residual-resource","display_name":"residual resource","score":0.33799999952316284}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.8494905829429626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6242029070854187},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6162481904029846},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.571763813495636},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5655485391616821},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.526915967464447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5071320533752441},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.42754727602005005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23748856782913208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10448801517486572},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2185354564","doi":null,"is_oa":true,"landing_page_url":"https://cyberleninka.ru/article/n/an-efficient-heuristic-algorithm-for-determining-optimal-redundancy-allocation-of-complex-networks","pdf_url":null,"source":{"id":"https://openalex.org/S4306525691","display_name":"Reliability: Theory & Applications","issn_l":"1932-2321","issn":["1932-2321"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-20","russia-white-list-3"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Reliability: Theory & Applications","raw_type":null}],"best_oa_location":{"id":"mag:2185354564","doi":null,"is_oa":true,"landing_page_url":"https://cyberleninka.ru/article/n/an-efficient-heuristic-algorithm-for-determining-optimal-redundancy-allocation-of-complex-networks","pdf_url":null,"source":{"id":"https://openalex.org/S4306525691","display_name":"Reliability: Theory & Applications","issn_l":"1932-2321","issn":["1932-2321"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-20","russia-white-list-3"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Reliability: Theory & Applications","raw_type":null},"sustainable_development_goals":[{"score":0.6773999929428101,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1972091512","https://openalex.org/W1986844778","https://openalex.org/W1996420761","https://openalex.org/W2001810430","https://openalex.org/W2002556623","https://openalex.org/W2007320715","https://openalex.org/W2014846325","https://openalex.org/W2024145586","https://openalex.org/W2029352273","https://openalex.org/W2052179756","https://openalex.org/W2063617671","https://openalex.org/W2075343578","https://openalex.org/W2076295239","https://openalex.org/W2077045998","https://openalex.org/W2082277000","https://openalex.org/W2085491510","https://openalex.org/W2104227708","https://openalex.org/W2109988251","https://openalex.org/W2114621702","https://openalex.org/W2116827549","https://openalex.org/W2129595584","https://openalex.org/W2129734500","https://openalex.org/W2132032636","https://openalex.org/W2143554619","https://openalex.org/W2148606018","https://openalex.org/W2163660488","https://openalex.org/W2165046421","https://openalex.org/W2170015254","https://openalex.org/W3144672859"],"related_works":["https://openalex.org/W2072568238","https://openalex.org/W3137560759","https://openalex.org/W2019879514","https://openalex.org/W2007320715","https://openalex.org/W2075343578","https://openalex.org/W1532482164","https://openalex.org/W2076295239","https://openalex.org/W1969156428","https://openalex.org/W2351096422","https://openalex.org/W2778072520"],"abstract_inverted_index":{"The":[0,83],"paper":[1],"presents":[2],"a":[3,40],"new":[4],"heuristic":[5,98],"algorithm":[6,18,85],"for":[7,55,80],"determining":[8],"optimal":[9],"redundancy":[10,81],"allocation":[11],"of":[12,26,35,68,70,95,105,111],"complex":[13],"networks.":[14],"Th":[15],"e":[16],"present":[17],"is":[19,48],"an":[20],"iterative":[21],"method;":[22],"all":[23],"the":[24,27,44,57,96],"paths":[25,77],"network":[28],"are":[29,78],"first":[30,50],"arranged":[31],"in":[32,91],"decreasing":[33],"order":[34],"their":[36],"priority":[37,46,76],"determined":[38],"using":[39],"path":[41,47,58],"sensitivity":[42],"factor,":[43],"highest":[45],"optimized":[49],"by":[51],"adding":[52],"redundant":[53],"components":[54,106],"suof":[56],"iteratively":[59],"based":[60],"on":[61],"proposed":[62,84],"subsystem":[63],"selection":[64],"factor.":[65],"In":[66],"case":[67],"availability":[69],"any":[71,108],"residual":[72],"resources":[73],"next":[74],"lower":[75],"considered":[79],"allocation.":[82],"not":[86],"only":[87],"demonstrates":[88],"improved":[89],"performance":[90],"comparison":[92],"with":[93],"most":[94],"existing":[97],"algorithms":[99],"but":[100],"also":[101],"leaves":[102],"minimum":[103],"slack":[104],"without":[107],"further":[109],"possibility":[110],"redundancy.":[112]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2016-06-24T00:00:00"}