Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/122339
Author(s): João Tomé Saraiva
Luiz Eduardo Oliveira
Phillipe Vilaça
Francisco Freitas
Title: A three-stage multi-year transmission expansion planning using heuristic, metaheuristic and decomposition techniques
Issue Date: 2019-06-23
Abstract: Security and quality of supply continue to be major concern of power system operators. Thus, the expansion of transmission grids is certainly one of the major drivers to achieve this goal. In this scope, this paper presents a three-stage approach to solve the multi-year Transmission Expansion Planning (TEP) problem. This approach uses heuristic algorithms coupled with the Harmony Search (HS) metaheuristic and the Branch & Bound (B&B) algorithm. This hybrid method (HS-B&B) aims at finding the optimal multi-stage investment plan avoiding load shedding over the planning horizon. In this work, the AC-Optimal Power Flow (AC-OPF) is used to model the network as a way to consider the real operation conditions of the system. The method was validated using the Garver and the IEEE RTS 24 bus systems. Results demonstrate the reduction of computational effort without compromising the quality of the TEP.
Subject: Engenharia electrotécnica, Engenharia electrotécnica, electrónica e informática
Electrical engineering, Electrical engineering, Electronic engineering, Information engineering
Scientific areas: Ciências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática
Engineering and technology::Electrical engineering, Electronic engineering, Information engineering
DOI: 10.1109/ptc.2019.8810478
URI: https://hdl.handle.net/10216/122339
Source: 2019 IEEE Milan PowerTech
Document Type: Artigo em Livro de Atas de Conferência Internacional
Rights: restrictedAccess
Appears in Collections:FEUP - Artigo em Livro de Atas de Conferência Internacional

Files in This Item:
File Description SizeFormat 
352627.pdf
  Restricted Access
316.74 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.