A Strategy to Solve the Multistage Transmission Expansion Planning Problem

In this letter, a heuristic to reduce the combinatorial search space (CSS) of the multistage transmission expansion planning (MTEP) problem is presented. The aim is to solve the MTEP modeled like a mixed binary linear programming (MBLP) problem using a commercial solver with a low computational time...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on power systems Ročník 26; číslo 4; s. 2574 - 2576
Hlavní autoři: Vinasco, G., Rider, M. J., Romero, R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2011
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Combinatorial analysis
Combinatorial mathematics
Combinatorial optimization
Conferences
Heuristic
Linear programming
Mathematical models
mixed binary linear programming problem
Multistage
multistage transmission expansion planning
Power system planning
Searching
Solvers
Strategy
ISSN:0885-8950, 1558-0679
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this letter, a heuristic to reduce the combinatorial search space (CSS) of the multistage transmission expansion planning (MTEP) problem is presented. The aim is to solve the MTEP modeled like a mixed binary linear programming (MBLP) problem using a commercial solver with a low computational time. The heuristic uses the solution of several static transmission expansion planning problems to obtain the reduced CSS. Results using some test and real systems show that the use of the reduced CSS solves the MTEP problem with better solutions compared to other strategies in the literature.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ObjectType-Conference-3
SourceType-Conference Papers & Proceedings-2
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2011.2126291