Abstract
Smart grids are automated, distributed energy exchange networks that, in contrast to traditional electricity grids, feature reconfigurable network topologies. Network planning is an essential function of smart grids that connects customers to energy sources using available physical links in the network. We model this as the problem of creating a spanning forest with a capacity constraint on each tree bounding its total weight. Each tree of the forest corresponds to a set of customers, rooted at a source. We call this the Capacitated Spanning Forest (CSF) problem. CSF is NP-complete even on unweighted graphs with two sources. We present a solution to this problem using a Local Search heuristic and demonstrate its performance on square grids and on a real-world sample grid topology.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 26th IEEE International Symposium on Industrial Electronics, ISIE 2017 |
| Publisher | IEEE |
| Pages | 1212-1218 |
| Number of pages | 7 |
| ISBN (Electronic) | 978-1-5090-1412-5 |
| DOIs | |
| Publication status | Published - 8 Aug 2017 |
| MoE publication type | A4 Conference publication |
| Event | International Symposium on Industrial Electronics - Edinburgh, United Kingdom Duration: 19 Jun 2017 → 21 Jun 2017 Conference number: 26 |
Publication series
| Name | Proceedings of the IEEE International Symposium on Industrial Electronics |
|---|---|
| Publisher | IEEE |
| ISSN (Print) | 2163-5137 |
| ISSN (Electronic) | 2380-1395 |
Conference
| Conference | International Symposium on Industrial Electronics |
|---|---|
| Abbreviated title | ISIE |
| Country/Territory | United Kingdom |
| City | Edinburgh |
| Period | 19/06/2017 → 21/06/2017 |
