Reduction of the Computational Burden of the TEP Problem by a Minimum-Effort Heuristic Algorithm

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

Autores

João Tomé Saraiva (Autor) FEUP; Luiz Oliveira (Autor) Outra; Phillipe Vilaça Gomes (Autor) Outra; Camile Moraes (Autor) Outra; Augusto Oliveira (Autor) Outra; Isabela Miranda de Mendonça (Autor) Outra

Ata de Conferência Internacional

Título: 2021 IEEE MADRID POWERTECH

Páginas: 1-6

14th IEEE Madrid PowerTech Conference (IEEE POWERTECH)

ELECTR NETWORK, JUN 28-JUL 02, 2021

Indexação

ISI Web of Knowledge - 0 Citações

ISI Web of Science

Scopus - 0 Citações

ScienceDirect (Elsevier)

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

ID Authenticus: P-00V-N7Z

DOI: 10.1109/powertech46648.2021.9495035

Abstract (EN): This paper presents a heuristic algorithm to reduce the set of equipment candidates for Transmission Expansion Planning (TEP). Since it is a Constructive Heuristic Algorithm (CHA), the MiniEff algorithm aims at reducing the computational burden involved in the optimization process in a quick and satisfactory way. This approach includes two major blocks. The first one uses the minimum-effort calculation based on DC-OPF analysis to reduce the search space of the TEP problem. Then, the reduced list of investment alternatives is input to the AC-TEP formulation to build the final expansion plan using the Evolutionary Particle Swarm Optimization technique (EPSO). The tests on the developed TEP approach were done using the IEEE 118 Bus System and they demonstrate the gains that were obtained in terms of reducing the computer burden in solving TEP without compromising the quality of the final plans.

Idioma: Inglês

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

Nº de páginas: 6