Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem
Nenhuma Miniatura disponível
Data
2013-01-04
Autores
Rahmani, Mohsen [UNESP]
Romero, Ruben [UNESP]
Rider, Marcos J. [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.
Descrição
Palavras-chave
Binary numeral system, disjunctive model (DM), GRASP-CP, multistage transmission expansion planning, reduced disjunctive model (RDM), Multi-stage transmission expansion, Expansion, Electric power transmission
Como citar
IEEE Transactions on Power Systems, v. 28, n. 3, p. 2164-2173, 2013.