Strategies to Reduce the Number of Variables and the Combinatorial Search Space of the Multistage Transmission Expansion Planning Problem

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on power systems Ročník 28; číslo 3; s. 2164 - 2173
Hlavní autori: Rahmani, Mohsen, Romero, Ruben, Rider, Marcos J.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.08.2013
Predmet:
Binary numeral system
Computational modeling
disjunctive model (DM)
GRASP-CP
Investments
Linear programming
Mathematical model
multistage transmission expansion planning
Planning
Power transmission lines
reduced disjunctive model (RDM)
Search problems
ISSN:0885-8950, 1558-0679
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2012.2223241