Network planning in smart grids via a local search heuristic for spanning forest problems

George Davidescu; Thomas Stutzle; Valeriy Vyatkin

doi:10.1109/ISIE.2017.8001418

Network planning in smart grids via a local search heuristic for spanning forest problems

George Davidescu, Thomas Stutzle, Valeriy Vyatkin

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference article in proceedings › Scientific › vertaisarvioitu

Abstrakti

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.

Alkuperäiskieli	Englanti
Otsikko	Proceedings of the 26th IEEE International Symposium on Industrial Electronics, ISIE 2017
Kustantaja	IEEE
Sivut	1212-1218
Sivumäärä	7
ISBN (elektroninen)	978-1-5090-1412-5
DOI - pysyväislinkit	https://doi.org/10.1109/ISIE.2017.8001418
Tila	Julkaistu - 8 elok. 2017
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa
Tapahtuma	International Symposium on Industrial Electronics - Edinburgh, Iso-Britannia Kesto: 19 kesäk. 2017 → 21 kesäk. 2017 Konferenssinumero: 26

Julkaisusarja

Nimi	Proceedings of the IEEE International Symposium on Industrial Electronics
Kustantaja	IEEE
ISSN (painettu)	2163-5137
ISSN (elektroninen)	2380-1395

Conference

Conference	International Symposium on Industrial Electronics
Lyhennettä	ISIE
Maa/Alue	Iso-Britannia
Kaupunki	Edinburgh
Ajanjakso	19/06/2017 → 21/06/2017

YK:n kestävän kehityksen tavoitteet

Tämä tuotos edistää seuraavia kestävän kehityksen tavoitteita:

Pääsy asiakirjaan

10.1109/ISIE.2017.8001418

Siteeraa tätä

Davidescu, G., Stutzle, T., & Vyatkin, V. (2017). Network planning in smart grids via a local search heuristic for spanning forest problems. teoksessa Proceedings of the 26th IEEE International Symposium on Industrial Electronics, ISIE 2017 (Sivut 1212-1218). (Proceedings of the IEEE International Symposium on Industrial Electronics). IEEE. https://doi.org/10.1109/ISIE.2017.8001418

@inproceedings{ff82bb7b409a4eb58be02dd0c2022e66,

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.",

author = "George Davidescu and Thomas Stutzle and Valeriy Vyatkin",

year = "2017",

month = aug,

day = "8",

doi = "10.1109/ISIE.2017.8001418",

language = "English",

series = "Proceedings of the IEEE International Symposium on Industrial Electronics",

publisher = "IEEE",

pages = "1212--1218",

booktitle = "Proceedings of the 26th IEEE International Symposium on Industrial Electronics, ISIE 2017",

address = "United States",

note = "International Symposium on Industrial Electronics, ISIE ; Conference date: 19-06-2017 Through 21-06-2017",

}

Davidescu, G, Stutzle, T & Vyatkin, V 2017, Network planning in smart grids via a local search heuristic for spanning forest problems. julkaisussa Proceedings of the 26th IEEE International Symposium on Industrial Electronics, ISIE 2017. Proceedings of the IEEE International Symposium on Industrial Electronics, IEEE, Sivut 1212-1218, International Symposium on Industrial Electronics, Edinburgh, Iso-Britannia, 19/06/2017. https://doi.org/10.1109/ISIE.2017.8001418

Network planning in smart grids via a local search heuristic for spanning forest problems. / Davidescu, George; Stutzle, Thomas; Vyatkin, Valeriy.
Proceedings of the 26th IEEE International Symposium on Industrial Electronics, ISIE 2017. IEEE, 2017. s. 1212-1218 (Proceedings of the IEEE International Symposium on Industrial Electronics).

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference article in proceedings › Scientific › vertaisarvioitu

TY - GEN

T1 - Network planning in smart grids via a local search heuristic for spanning forest problems

AU - Davidescu, George

AU - Stutzle, Thomas

AU - Vyatkin, Valeriy

N1 - Conference code: 26

PY - 2017/8/8

Y1 - 2017/8/8

N2 - 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.

AB - 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.

U2 - 10.1109/ISIE.2017.8001418

DO - 10.1109/ISIE.2017.8001418

M3 - Conference article in proceedings

T3 - Proceedings of the IEEE International Symposium on Industrial Electronics

SP - 1212

EP - 1218

BT - Proceedings of the 26th IEEE International Symposium on Industrial Electronics, ISIE 2017

PB - IEEE

T2 - International Symposium on Industrial Electronics

Y2 - 19 June 2017 through 21 June 2017

ER -

Network planning in smart grids via a local search heuristic for spanning forest problems

Abstrakti

Julkaisusarja

Conference

YK:n kestävän kehityksen tavoitteet

Pääsy asiakirjaan

Sormenjälki

Siteeraa tätä