Evaluation of the performance of space reduction technique using AC and DC models in Transmission Expansion problems

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2016-06-06

Autores

João Tomé Saraiva (Autor) FEUP; Phillipe Vilaça Gomes (Autor) Outra

Ata de Conferência Internacional

Título: 13th International Conference on the European Energy Market

Páginas: 1-5

Indexação

ISI Web of Knowledge

ISI Web of Science

Scopus

INSPEC

Classificação Científica

CORDIS: Ciências Tecnológicas > Engenharia > Engenharia electrotécnica

FOS: Ciências da engenharia e tecnologias > Engenharia electrotécnica, electrónica e informática

Outras Informações

DOI: 10.1109/EEM.2016.7521351

Abstract (EN): Transmission Expansion Planning (TEP) is an optimization problem that has a non-convex and combinatorial search space so that several solution algorithms may converge to local optima. Therefore, many works have been proposed to solve the TEP problem considering its relaxation or reducing its search space. In any case, relaxation and reduction approaches should not compromise the quality of the final solution. This paper aims at analyzing the performance of a search space technique using a Constructive Heuristic Algorithm (CHA) admitting that the TEP problem is then solved using a Discreet Evolutionary Particle Swarm Optimization (DEPSO). On one hand the reduction quality is performed by analyzing whether the optimal expansion routes are included in the CHA constrained set and, on the other hand, the relaxation quality of the DC model is analyzed by checking if the optimal solution obtained with it violates any constraint using the AC model. The simulations were performed using three different test systems. The results suggest that the proposed CHA provides very good results in reducing the TEP search space and that the adoption of the DC model originates several violations if the full AC model is used to model the operation of the power system.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 5