Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Recolector de Cienci...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
versions View all 2 versions
addClaim

Análisis de Seguridad en Redes Eléctricas mediante Factores de Distribución

Authors: Marrón Borrego, Álvaro;

Análisis de Seguridad en Redes Eléctricas mediante Factores de Distribución

Abstract

El objeto del presente proyecto es programar una serie de algoritmos que permitan realizar análisis de seguridad N-1 a redes eléctricas. Esto se conseguirá mediante el uso de factores de distribución. La programación de los algoritmos se realizará a través de Matlab. Los resultados obtenidos mediante el uso de factores de distribución serán comparados con los obtenidos tras realizar el mismo análisis utilizando métodos iterativos. Por ello, construiremos algoritmos para realizar flujos de cargas mediante Newton-Raphson y DCLF. También para analizar contingencias en generadores y contingencias en líneas mediante factores de distribución. Estos resultados se compararán a través de flujos de cargas empleando Newton-Raphson. Además, diseñaremos una interfaz gráfica para automatizar la ejecución de los algoritmos. Realizaremos estos análisis de seguridad a cuatro redes: IEEE-14, IEEE-39, IEEE-118 e IEEE-300, cada una más compleja y compuesta por más nudos. Con esto se pretende estudiar las ventajas y las desventajas en cada caso de los algoritmos en los que se usan los factores de distribución frente a los métodos iterativos. Con la red IEEE-14 veremos que el error cometido por los factores de distribución se reduce cuando partimos de flujos más exactos, como los calculados mediante Newton-Raphson. Sin embargo, comprobaremos que esto no siempre es posible, bien porque se alcanzan tiempos de ejecución de horas, como es el caso de la red IEEE-300, o porque el método no converge, como ocurre con la red IEEE-118. Además, a través del análisis de la red IEEE-39 compararemos la fiabilidad de los resultados obtenidos mediante factores de distribución para la detección de sobrecargas. Comprobaremos que no todas se detectan satisfactoriamente, debido al error que se comete. Gracias a los análisis de estas redes obtendremos las principales características que se obtienen de los factores de distribución:  Bajo coste computacional.  Tiempos de ejecución del orden de segundos.  Se puede emplear en todo tipo de redes.  Errores debidos a la linealización del problema P - 0.  Problemas en la detección de sobrecargas.

The purpose of this project is to program a series of algorithms that allow N-1 security analysis to be carried out on electrical networks. This will be achieved through the use of distribution factors. The programming of the algorithms will be done through Matlab. The results obtained through the use of distribution factors will be compared with those obtained after carrying out the same analysis using iterative methods. Therefore, we will build algorithms to perform load flows using Newton-Raphson and DCLF. Also to analyze contingencies in generators and contingencies in lines through distribution factors. These results will be compared through load flows using Newton-Raphson. We will also design a graphical interface to automate the execution of the algorithms. We will perform these security analyzes on four networks: IEEE-14, IEEE-39, IEEE-118 and IEEE-300, each one more complex and composed of more nodes. This is intended to study the advantages and disadvantages in each case of the algorithms in which distribution factors are used compared to iterative methods. With the IEEE-14 network we will see that the error made by the distribution factors is reduced when we start from more exact flows, such as those calculated using Newton-Raphson. However, this is not always possible, either because execution times of hours are reached, as is the case with the IEEE-300 network, or because the method does not converge, as is the case with the IEEE-118 network. In addition, through the analysis of the IEEE-39 network we will compare the reliability of the results obtained by means of distribution factors for the detection of overloads. We will verify that not all of them are detected satisfactorily, due to the error that is made. Thanks to the analysis of these networks we will obtain the main characteristics obtained from the distribution factors:  Low computational cost.  Execution times on the order of seconds.  It can be used in all types of networks.  Errors due to the linearization of the P-0 problem.  Problems in the detection of overloads.

Universidad de Sevilla. Grado en Ingeniería de las Tecnologías Industriales

Country
Spain
Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green