Name
Title | ||
|---|---|---|
Network Planning In Smart Grids Via A Local Search Heuristic For Spanning Forest Problems |
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. |
Year | Venue | Field |
|---|---|---|
2017 | 2017 IEEE 26TH INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS (ISIE) | Heuristic,Mathematical optimization,Smart grid,Network planning and design,Network topology,Distributed generation,Energy source,Local search (optimization),Engineering,Grid,Distributed computing |
DocType | ISSN | Citations |
Conference | 2163-5137 | 1 |
PageRank | References | Authors |
0.35 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| George Davidescu | 1 | 1 | 0.69 |
| thomas stutzle | 2 | 5684 | 352.15 |
| Valeriy Vyatkin | 3 | 1047 | 152.80 |