A Search Space Reduction Strategy and a Mathematical Model for Multistage Transmission Expansion Planning with N-1 Security Constrains

Página do item simplificado
dc.contributor.authorda Silva, Emivan F.
dc.contributor.authorRahmani, Mohsen
dc.contributor.authorRider, Marcos J. [UNESP]
dc.contributor.institutionElectrical and Computer Engineering Department, Carnegie Mellon University
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2018-12-11T16:38:10Z
dc.date.available2018-12-11T16:38:10Z
dc.date.issued2014-01-01
dc.description.abstractThis 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.en
dc.description.affiliationDepartamento de Matemática, Universidade do Estado de Mato Grosso (UNEMAT)
dc.description.affiliationElectrical and Computer Engineering Department, Carnegie Mellon University
dc.description.affiliationDepartamento de Engenharia Elétrica, Universidade Estadual Paulista “Júlio de Mesquita Filho” (UNESP)
dc.description.affiliationUnespDepartamento de Engenharia Elétrica, Universidade Estadual Paulista “Júlio de Mesquita Filho” (UNESP)
dc.format.extent57-67
dc.identifierhttp://dx.doi.org/10.1007/s40313-014-0154-2
dc.identifier.citationJournal of Control, Automation and Electrical Systems, v. 26, n. 1, p. 57-67, 2014.
dc.identifier.doi10.1007/s40313-014-0154-2
dc.identifier.file2-s2.0-84921293624.pdf
dc.identifier.issn2195-3899
dc.identifier.issn2195-3880
dc.identifier.scopus2-s2.0-84921293624
dc.identifier.urihttp://hdl.handle.net/11449/167746
dc.language.isoeng
dc.relation.ispartofJournal of Control, Automation and Electrical Systems
dc.relation.ispartofsjr0,274
dc.relation.ispartofsjr0,274
dc.rights.accessRightsAcesso aberto
dc.sourceScopus
dc.subjectDisjunctive linear model
dc.subjectN-1 security constraints
dc.subjectSearch space reduction methodology
dc.subjectTransmission network expansion planning
dc.titleA Search Space Reduction Strategy and a Mathematical Model for Multistage Transmission Expansion Planning with N-1 Security Constrainsen
dc.typeArtigo

Arquivos

Pacote Original
Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
2-s2.0-84921293624.pdf
Tamanho:
410.22 KB
Formato:
Adobe Portable Document Format
Descrição:
Baixar

Coleções

Artigos