{"id":"https://openalex.org/W2773701838","doi":"https://doi.org/10.1109/iecon.2017.8216948","title":"Network planning and self-repair in models of urban distribution networks via Hill Climbing","display_name":"Network planning and self-repair in models of urban distribution networks via Hill Climbing","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2773701838","doi":"https://doi.org/10.1109/iecon.2017.8216948","mag":"2773701838"},"language":"en","primary_location":{"id":"doi:10.1109/iecon.2017.8216948","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iecon.2017.8216948","pdf_url":null,"source":{"id":"https://openalex.org/S4363608531","display_name":"IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009120821","display_name":"George Davidescu","orcid":null},"institutions":[{"id":"https://openalex.org/I127077003","display_name":"IMT School for Advanced Studies Lucca","ror":"https://ror.org/035gh3a49","country_code":"IT","type":"education","lineage":["https://openalex.org/I127077003"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"George Davidescu","raw_affiliation_strings":["IMT School for Advanced Studies Lucca, Lucca, Italy"],"affiliations":[{"raw_affiliation_string":"IMT School for Advanced Studies Lucca, Lucca, Italy","institution_ids":["https://openalex.org/I127077003"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008070913","display_name":"Valeriy Vyatkin","orcid":null},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Valeriy Vyatkin","raw_affiliation_strings":["Department of Electrical Engineering, Lule\u00e5 University of Technology, Lule\u00e5, Finland, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Lule\u00e5 University of Technology, Lule\u00e5, Finland, Sweden","institution_ids":["https://openalex.org/I190632392"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009120821"],"corresponding_institution_ids":["https://openalex.org/I127077003"],"apc_list":null,"apc_paid":null,"fwci":1.0329,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71510683,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"5477","last_page":"5482"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11106","display_name":"Data Management and Algorithms","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/computer-science","display_name":"Computer science","score":0.627285897731781},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.617290735244751},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5475602149963379},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.507023811340332},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4824664890766144},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.45604825019836426},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44462835788726807},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.43813055753707886},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.42155763506889343},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32631754875183105},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19459384679794312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1945447027683258},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14597460627555847},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1284041404724121}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.627285897731781},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.617290735244751},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5475602149963379},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.507023811340332},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4824664890766144},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.45604825019836426},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44462835788726807},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.43813055753707886},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.42155763506889343},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32631754875183105},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19459384679794312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1945447027683258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14597460627555847},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1284041404724121},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iecon.2017.8216948","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iecon.2017.8216948","pdf_url":null,"source":{"id":"https://openalex.org/S4363608531","display_name":"IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1606114348","https://openalex.org/W1972674272","https://openalex.org/W2011039300","https://openalex.org/W2074103996","https://openalex.org/W2132022337","https://openalex.org/W2145691535","https://openalex.org/W2159396498","https://openalex.org/W2242464395","https://openalex.org/W2744697629","https://openalex.org/W6681618874"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1984006984"],"abstract_inverted_index":{"Network":[0],"Planning":[1],"and":[2,6,78],"Fault":[3],"Location,":[4],"Isolation":[5],"Supply":[7],"Restoration":[8],"(FLISR)":[9],"are":[10],"important":[11],"functions":[12,21],"of":[13,39,68],"power":[14],"distribution":[15],"automation":[16],"systems.":[17],"We":[18,55],"model":[19],"these":[20],"as":[22,36],"a":[23,41,45,61],"combinatorial":[24],"optimization":[25],"graph":[26],"problem":[27,38],"called":[28],"the":[29,37,66],"Capacitated":[30],"Spanning":[31],"Forest":[32],"Problem":[33],"(CSF),":[34],"defined":[35],"creating":[40],"spanning":[42],"forest":[43],"with":[44],"capacity":[46],"constraint":[47],"on":[48,60,82],"each":[49],"tree":[50],"bounding":[51],"its":[52],"total":[53],"weight.":[54],"present":[56],"an":[57],"algorithm":[58],"based":[59],"Hill":[62],"Climbing":[63],"heuristic":[64],"for":[65],"solution":[67],"CSF":[69],"that":[70],"can":[71],"be":[72],"used":[73],"to":[74],"solve":[75],"network":[76],"planning":[77],"supply":[79],"restoration":[80],"scenarios":[81],"large":[83],"graphs":[84],"representing":[85],"smart":[86],"grids.":[87]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}