A minimal spanning tree algorithm for distribution networks configuration

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferencia

18 Citas (Scopus)

Resumen

A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radial configuration. This type of problem becomes a non-differentiable, mixed integer, and highly combinatorial in nature. The Kruskal's algorithm is used to determine the minimum spanning tree, which has the characteristic to run in polynomial time.

Idioma originalInglés
Título de la publicación alojada2012 IEEE Power and Energy Society General Meeting, PES 2012
DOI
EstadoPublicada - 11 dic 2012
Evento2012 IEEE Power and Energy Society General Meeting, PES 2012 - San Diego, CA, Estados Unidos
Duración: 22 jul 201226 jul 2012

Serie de la publicación

NombreIEEE Power and Energy Society General Meeting
ISSN (versión impresa)1944-9925
ISSN (versión digital)1944-9933

Otros

Otros2012 IEEE Power and Energy Society General Meeting, PES 2012
PaísEstados Unidos
CiudadSan Diego, CA
Período22/07/1226/07/12

Huella dactilar

Electric power distribution
Trees (mathematics)
Polynomials

Citar esto

Montoya, D. P., & Ramirez Arredondo, J. J. M. (2012). A minimal spanning tree algorithm for distribution networks configuration. En 2012 IEEE Power and Energy Society General Meeting, PES 2012 [6344718] (IEEE Power and Energy Society General Meeting). https://doi.org/10.1109/PESGM.2012.6344718
Montoya, Diana P. ; Ramirez Arredondo, Jose Juan manuel. / A minimal spanning tree algorithm for distribution networks configuration. 2012 IEEE Power and Energy Society General Meeting, PES 2012. 2012. (IEEE Power and Energy Society General Meeting).
@inproceedings{f0748b6ca12d4129a398ae5d60ad405f,
title = "A minimal spanning tree algorithm for distribution networks configuration",
abstract = "A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radial configuration. This type of problem becomes a non-differentiable, mixed integer, and highly combinatorial in nature. The Kruskal's algorithm is used to determine the minimum spanning tree, which has the characteristic to run in polynomial time.",
keywords = "Distribution systems reconfiguration, Minimal Spanning Tree, Power loss reduction",
author = "Montoya, {Diana P.} and {Ramirez Arredondo}, {Jose Juan manuel}",
year = "2012",
month = "12",
day = "11",
doi = "10.1109/PESGM.2012.6344718",
language = "Ingl{\'e}s",
isbn = "9781467327275",
series = "IEEE Power and Energy Society General Meeting",
booktitle = "2012 IEEE Power and Energy Society General Meeting, PES 2012",

}

Montoya, DP & Ramirez Arredondo, JJM 2012, A minimal spanning tree algorithm for distribution networks configuration. En 2012 IEEE Power and Energy Society General Meeting, PES 2012., 6344718, IEEE Power and Energy Society General Meeting, 2012 IEEE Power and Energy Society General Meeting, PES 2012, San Diego, CA, Estados Unidos, 22/07/12. https://doi.org/10.1109/PESGM.2012.6344718

A minimal spanning tree algorithm for distribution networks configuration. / Montoya, Diana P.; Ramirez Arredondo, Jose Juan manuel.

2012 IEEE Power and Energy Society General Meeting, PES 2012. 2012. 6344718 (IEEE Power and Energy Society General Meeting).

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferencia

TY - GEN

T1 - A minimal spanning tree algorithm for distribution networks configuration

AU - Montoya, Diana P.

AU - Ramirez Arredondo, Jose Juan manuel

PY - 2012/12/11

Y1 - 2012/12/11

N2 - A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radial configuration. This type of problem becomes a non-differentiable, mixed integer, and highly combinatorial in nature. The Kruskal's algorithm is used to determine the minimum spanning tree, which has the characteristic to run in polynomial time.

AB - A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radial configuration. This type of problem becomes a non-differentiable, mixed integer, and highly combinatorial in nature. The Kruskal's algorithm is used to determine the minimum spanning tree, which has the characteristic to run in polynomial time.

KW - Distribution systems reconfiguration

KW - Minimal Spanning Tree

KW - Power loss reduction

UR - http://www.scopus.com/inward/record.url?scp=84870609516&partnerID=8YFLogxK

U2 - 10.1109/PESGM.2012.6344718

DO - 10.1109/PESGM.2012.6344718

M3 - Contribución a la conferencia

AN - SCOPUS:84870609516

SN - 9781467327275

T3 - IEEE Power and Energy Society General Meeting

BT - 2012 IEEE Power and Energy Society General Meeting, PES 2012

ER -

Montoya DP, Ramirez Arredondo JJM. A minimal spanning tree algorithm for distribution networks configuration. En 2012 IEEE Power and Energy Society General Meeting, PES 2012. 2012. 6344718. (IEEE Power and Energy Society General Meeting). https://doi.org/10.1109/PESGM.2012.6344718