A three-stage multi-year transmission expansion planning using heuristic, metaheuristic and decomposition techniques
| Autor: | João Tomé Saraiva, Francisco Damasceno Freitas, Luiz Eduardo de Oliveira, P. Vilaca Gomes |
|---|---|
| Přispěvatelé: | Faculdade de Engenharia |
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
Mathematical optimization
021103 operations research Branch and bound Heuristic (computer science) Computer science 020209 energy 0211 other engineering and technologies Engenharia electrotécnica electrónica e informática [Ciências da engenharia e tecnologias] Time horizon 02 engineering and technology Engenharia electrotécnica Engenharia electrotécnica electrónica e informática Electrical engineering Electronic engineering Information engineering [Engineering and technology] Reduction (complexity) Transmission (telecommunications) 0202 electrical engineering electronic engineering information engineering Decomposition (computer science) Harmony search Electrical engineering Electrical engineering Electronic engineering Information engineering Metaheuristic |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|