Abstrakti
Network Planning and Fault Location, Isolation and Supply Restoration (FLISR) are important functions of power distribution automation systems. We model these functions as a combinatorial optimization graph problem called the Capacitated Spanning Forest Problem (CSF), defined as the problem of creating a spanning forest with a capacity constraint on each tree bounding its total weight. We present an algorithm based on a Hill Climbing heuristic for the solution of CSF that can be used to solve network planning and supply restoration scenarios on large graphs representing smart grids.
Alkuperäiskieli | Englanti |
---|---|
Otsikko | Proceedings IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society |
Kustantaja | IEEE |
Sivut | 5477-5488 |
Sivumäärä | 6 |
ISBN (elektroninen) | 978-1-5386-1127-2 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 18 jouluk. 2017 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisussa |
Tapahtuma | Annual Conference of the IEEE Industrial Electronics Society - Beijing, Kiina Kesto: 29 lokak. 2017 → 1 marrask. 2017 Konferenssinumero: 43 http://iecon2017.csp.escience.cn/ |
Julkaisusarja
Nimi | Proceedings of the Annual Conference of the IEEE Industrial Electronics Society |
---|---|
Kustantaja | IEEE |
ISSN (painettu) | 1553-572X |
Conference
Conference | Annual Conference of the IEEE Industrial Electronics Society |
---|---|
Lyhennettä | IECON |
Maa/Alue | Kiina |
Kaupunki | Beijing |
Ajanjakso | 29/10/2017 → 01/11/2017 |
www-osoite |