A Search Space Reduction Strategy and a Mathematical Model for Multistage Transmission Expansion Planning with N-1 Security Constrains
Carregando...
Data
2014-01-01
Autores
da Silva, Emivan F.
Rahmani, Mohsen
Rider, Marcos J. [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
This paper proposes a linear disjunctive model to solve a multistage transmission expansion planning problem (MTEP) considering N - 1 security constraints. The use of a disjunctive linear model guarantees finding the optimum solution of the problems using existing classical optimization methods. For large-scale systems, when finding the optimum or even high-quality solutions of the MTEP problem is not possible in polynomial time, a search space reduction methodology (SSRM) is proposed. By using SSRM, it is possible to obtain very high-quality solutions or in most cases the optimum solution of the MTEP problem. The N - 1 security constraint indicates that the transmission system must be expanded in such a way that, despite the outage of a system line (a pre-defined set of contingencies), the system continues to operate properly. The model was implemented using a modelling language for mathematical programming (AMPL) and solved using the CPLEX, which is a commercial solver. The IEEE 24-bus, Colombian 93-bus, and Bolivian 57-bus systems are used to evaluate and show the performance of the proposed mathematical model and the search space reduction strategy.
Descrição
Palavras-chave
Disjunctive linear model, N-1 security constraints, Search space reduction methodology, Transmission network expansion planning
Como citar
Journal of Control, Automation and Electrical Systems, v. 26, n. 1, p. 57-67, 2014.