Por favor, use este identificador para citar o enlazar este ítem:
http://dspace.ucuenca.edu.ec/handle/123456789/31438
Título : | Static and dynamic convex distribution network expansion planning |
Autor: | Lopez Quizhpi, Julio Cesar Pozo, David |
Palabras clave : | Capacitor Banks Convex Optimization Dynamic Model Electric Distribution Network Expansion Planning Static Models Voltage Regulators |
Área de conocimiento FRASCATI amplio: | 2. INGENIERIA Y TECNOLOGIA |
Área de conocimiento FRASCATI detallado: | 2.2.4 INGENIERIA DE LA COMUNICACION Y DE SISTEMAS |
Área de conocimiento FRASCATI específico: | 2.2 INGENIERIAS ELECTRICA, ELECTRONICA E INFORMACION |
Área de conocimiento UNESCO amplio: | 06 - INFORMACION Y COMUNICACION (TIC) |
ÁArea de conocimiento UNESCO detallado: | 0612 - BASE DE DATOS, DISENO Y ADMINISTRACION DE REDES |
Área de conocimiento UNESCO específico: | 061 - INFORMACION Y COMUNICACION (TIC) |
Fecha de publicación : | 2018 |
Fecha de fin de embargo: | 28-dic-2050 |
Paginación: | Páginas 41-63 |
Fuente: | Power Systems |
metadata.dc.identifier.doi: | 10.1007/978-981-10-7056-3_2 |
Editor: | Springer Verlag |
Tipo: | CAPÍTULO DE LIBRO |
Abstract: | This chapter presents static and dynamic optimization-based models for planning the electric distribution network. Based on a branch flow model, two Mixed-Integer Conic Quadratic Programming (MICQP) convex formulations are proposed to solve the network expansion planning models including high modeling fidelity of the intrinsic interaction of the manifold elements of the networks. The objective of the presented models is to minimize investment and operation costs by optimally deciding on installing new feeders and/or changing existing ones for others with larger capacities, installing new substations or expanding existing ones and, finally, installing capacitor banks and voltage regulators, modifying the network topology. In addition, discrete tap settings of voltage regulators are modeled as a set of mixed-integer linear equations, which are embedded in an ac optimal power flow. The presented MICQP models are convex optimization problems. Therefore globality and convergence are guaranteed. Computational results to verify the efficiency of the proposed methodology are obtained for a 24-node test system. Finally, conclusions are duly drawn |
Resumen : | This chapter presents static and dynamic optimization-based models for planning the electric distribution network. Based on a branch flow model, two Mixed-Integer Conic Quadratic Programming (MICQP) convex formulations are proposed to solve the network expansion planning models including high modeling fidelity of the intrinsic interaction of the manifold elements of the networks. The objective of the presented models is to minimize investment and operation costs by optimally deciding on installing new feeders and/or changing existing ones for others with larger capacities, installing new substations or expanding existing ones and, finally, installing capacitor banks and voltage regulators, modifying the network topology. In addition, discrete tap settings of voltage regulators are modeled as a set of mixed-integer linear equations, which are embedded in an ac optimal power flow. The presented MICQP models are convex optimization problems. Therefore globality and convergence are guaranteed. Computational results to verify the efficiency of the proposed methodology are obtained for a 24-node test system. Finally, conclusions are duly drawn |
URI : | http://dspace.ucuenca.edu.ec/handle/123456789/31438 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85045377458&origin=inward |
ISBN : | 0 |
ISSN : | 1612-1287 |
Aparece en las colecciones: | Artículos
|
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.