Optimal Distribution Systems Expansion Planning for Improving Service Restoration

Autor(es)

Macedo, Leonardo H. ; Ortega-Vazquez, Miguel A. ; Romero, Ruben ; IEEE

• Tipo de documento: Artigo Científico
• Fonte: PROCEEDINGS OF THE 2018 IEEE PES TRANSMISSION & DISTRIBUTION CONFERENCE AND EXHIBITION - LATIN AMERICA (T&D-LA); v. N/A, p. 5-pg., 2018-01-01.

Resumo

This paper presents a mixed-integer second order cone programming model for the problem of optimal distribution systems expansion planning for improving service restoration. The objective is to obtain a network that allows the load to be restored after the occurrence of a contingency. Expansion of new substations, reinforcement of existing ones, addition and reconductoring of feeders are considered in the formulation of this problem. The objective is to find a meshed network that minimizes expansion costs, as well as the radial topologies for operation in predefined contingency scenarios that minimize the energy not supplied. The model considers the full ac power flow equations for the operation of the system. A 24-node network is used to demonstrate the effectiveness of the proposed method. A comparison of the costs of the traditional planning with the costs of planning considering service restoration is carried out. (AU)

• Processo FAPESP: 14/23741-9 - Planejamento da expansão de sistemas de distribuição de energia elétrica
• Beneficiário: Leonardo Henrique Faria Macedo Possagnolo
• Modalidade de apoio: Bolsas no Brasil - Doutorado
• Processo FAPESP: 16/10992-9 - Métodos de otimização para o planejamento da expansão de sistemas de distribuição de energia elétrica considerando confiabilidade
• Beneficiário: Leonardo Henrique Faria Macedo Possagnolo
• Modalidade de apoio: Bolsas no Exterior - Estágio de Pesquisa - Doutorado
• Processo FAPESP: 15/21972-6 - Otimização do planejamento e da operação de sistemas de transmissão e de distribuição de energia elétrica
• Beneficiário: Rubén Augusto Romero Lázaro
• Modalidade de apoio: Auxílio à Pesquisa - Temático