{"id":"https://openalex.org/W4393352772","doi":"https://doi.org/10.3390/systems12040117","title":"Resilient Network Design: Disjoint Shortest Path Problem for Power Transmission Application","display_name":"Resilient Network Design: Disjoint Shortest Path Problem for Power Transmission Application","publication_year":2024,"publication_date":"2024-03-31","ids":{"openalex":"https://openalex.org/W4393352772","doi":"https://doi.org/10.3390/systems12040117"},"language":"en","primary_location":{"id":"doi:10.3390/systems12040117","is_oa":true,"landing_page_url":"https://doi.org/10.3390/systems12040117","pdf_url":"https://www.mdpi.com/2079-8954/12/4/117/pdf?version=1711874666","source":{"id":"https://openalex.org/S4210219410","display_name":"Systems","issn_l":"2079-8954","issn":["2079-8954"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2079-8954/12/4/117/pdf?version=1711874666","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101938044","display_name":"Amit Kumar Jha","orcid":"https://orcid.org/0009-0003-2541-4832"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Amit Jha","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Calgary, Calgary, AB T2N 1N4, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Calgary, Calgary, AB T2N 1N4, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000633335","display_name":"Haotian Song","orcid":"https://orcid.org/0000-0001-8049-2516"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haotian Song","raw_affiliation_strings":["School of Management, Zhejiang University, Hangzhou 310058, China","School of Management, Zhejiang University, Hangzhou 310027, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, Zhejiang University, Hangzhou 310058, China","institution_ids":["https://openalex.org/I76130692"]},{"raw_affiliation_string":"School of Management, Zhejiang University, Hangzhou 310027, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028777464","display_name":"Yuriy Zinchenko","orcid":null},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]},{"id":"https://openalex.org/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]}],"countries":["CA","US"],"is_corresponding":true,"raw_author_name":"Yuriy Zinchenko","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Calgary, Calgary, AB T2N 1N4, Canada","Gurobi Optimization, LLC, Beaverton, OR 97008-7105, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Calgary, Calgary, AB T2N 1N4, Canada","institution_ids":["https://openalex.org/I168635309"]},{"raw_affiliation_string":"Gurobi Optimization, LLC, Beaverton, OR 97008-7105, USA","institution_ids":["https://openalex.org/I4210089412"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028777464"],"corresponding_institution_ids":["https://openalex.org/I168635309","https://openalex.org/I4210089412"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1732},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1732},"fwci":0.2814,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54882374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"12","issue":"4","first_page":"117","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9735999703407288,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9395999908447266,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.758202314376831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7198588848114014},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6193433403968811},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5642037391662598},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4973655045032501},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.477495402097702},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4618711769580841},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43237584829330444},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42940670251846313},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3906612992286682},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3874807357788086},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.346457302570343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30788475275039673},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28330034017562866},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17477557063102722},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1660652756690979}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.758202314376831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7198588848114014},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6193433403968811},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5642037391662598},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4973655045032501},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.477495402097702},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4618711769580841},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43237584829330444},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42940670251846313},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3906612992286682},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3874807357788086},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.346457302570343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30788475275039673},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28330034017562866},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17477557063102722},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1660652756690979},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/systems12040117","is_oa":true,"landing_page_url":"https://doi.org/10.3390/systems12040117","pdf_url":"https://www.mdpi.com/2079-8954/12/4/117/pdf?version=1711874666","source":{"id":"https://openalex.org/S4210219410","display_name":"Systems","issn_l":"2079-8954","issn":["2079-8954"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:f2cfe840f0bb437899afa5789aafccc8","is_oa":true,"landing_page_url":"https://doaj.org/article/f2cfe840f0bb437899afa5789aafccc8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Systems, Vol 12, Iss 4, p 117 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/systems12040117","is_oa":true,"landing_page_url":"https://doi.org/10.3390/systems12040117","pdf_url":"https://www.mdpi.com/2079-8954/12/4/117/pdf?version=1711874666","source":{"id":"https://openalex.org/S4210219410","display_name":"Systems","issn_l":"2079-8954","issn":["2079-8954"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.4300000071525574}],"awards":[{"id":"https://openalex.org/G832689143","display_name":null,"funder_award_id":"RGPIN-2019","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4393352772.pdf"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1926828057","https://openalex.org/W1997535374","https://openalex.org/W2007572995","https://openalex.org/W2032889054","https://openalex.org/W2047746040","https://openalex.org/W2066459185","https://openalex.org/W2066851066","https://openalex.org/W2068258696","https://openalex.org/W2077585566","https://openalex.org/W2084224084","https://openalex.org/W2104734478","https://openalex.org/W2116006926","https://openalex.org/W2131058166","https://openalex.org/W2147169375","https://openalex.org/W2153169733","https://openalex.org/W2154434560","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2482935363","https://openalex.org/W2566091043","https://openalex.org/W2793433226","https://openalex.org/W2987767782","https://openalex.org/W3111732903","https://openalex.org/W4229663176","https://openalex.org/W4286587478","https://openalex.org/W4293860495","https://openalex.org/W4304190347","https://openalex.org/W4390643377","https://openalex.org/W6671329661","https://openalex.org/W6683050674","https://openalex.org/W6802334842"],"related_works":["https://openalex.org/W2767202586","https://openalex.org/W2198982833","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2018146256","https://openalex.org/W2161960576","https://openalex.org/W2388051136"],"abstract_inverted_index":{"Path":[0],"redundancy":[1],"is":[2,67,75,93,109,157],"essential":[3],"for":[4,19,138],"safety":[5],"and":[6,101,111,162],"reliability":[7],"in":[8,46,124],"many":[9],"real-world":[10],"routing":[11],"problems,":[12],"such":[13,58,170],"as":[14,171],"the":[15,31,39,47,60,64,81,98,122,132,143],"design":[16],"of":[17,63,80],"networks":[18],"power":[20,139],"transmission,":[21],"transportation,":[22],"etc.":[23],"These":[24],"problems":[25],"are":[26,56],"typically":[27],"posed":[28],"to":[29,97,116,121],"find":[30,117],"shortest":[32,40],"path":[33,41,43,73],"on":[34,134,166],"a":[35,70,84,125,135,147,167],"weighted":[36],"graph.":[37],"For":[38],"with":[42,146],"redundancy,":[44],"particularly":[45],"Disjoint":[48],"Shortest":[49],"2-Path":[50],"(DS2P)":[51],"problem,":[52],"two":[53,65],"disjoint":[54],"paths":[55,66],"desired":[57],"that":[59],"combined":[61],"weight":[62],"minimized":[68],"while":[69],"minimum":[71],"distance":[72],"separation":[74],"maintained.":[76],"The":[77,153],"conventional":[78],"formulation":[79],"above":[82],"requires":[83],"large-scale":[85],"mixed-integer":[86],"programming":[87],"(MIP)":[88],"model.":[89],"However,":[90],"this":[91],"approach":[92,133],"practically":[94],"intractable":[95],"due":[96],"model\u2019s":[99],"complexity":[100],"extremely":[102],"long":[103],"run-time.":[104],"We":[105,130],"demonstrate":[106,131],"why":[107],"DS2P":[108],"NP-complete":[110],"propose":[112],"an":[113,118],"efficient":[114],"heuristic":[115],"approximate":[119],"solution":[120],"problem":[123],"much":[126],"shorter":[127],"time":[128],"frame.":[129],"realistic":[136],"dataset":[137],"transmission":[140],"routing,":[141],"integrating":[142],"computational":[144],"methodology":[145],"visualization":[148],"interface":[149],"using":[150],"Google":[151],"Maps.":[152],"resulting":[154],"prototype":[155],"software":[156],"freely":[158],"available":[159],"through":[160],"GitHub":[161],"can":[163],"be":[164],"deployed":[165],"cloud":[168],"platform,":[169],"Amazon":[172],"AWS.":[173]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}