A Strategy to Solve the Multistage Transmission Expansion Planning Problem
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
20/05/2014
20/05/2014
01/11/2011
|
| Resumo |
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) 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. |
| Formato |
2574-2576 |
| Identificador |
http://dx.doi.org/10.1109/TPWRS.2011.2126291 IEEE Transactions on Power Systems. Piscataway: IEEE-Inst Electrical Electronics Engineers Inc, v. 26, n. 4, p. 2574-2576, 2011. 0885-8950 http://hdl.handle.net/11449/9826 10.1109/TPWRS.2011.2126291 WOS:000298784500089 |
| Idioma(s) |
eng |
| Publicador |
Institute of Electrical and Electronics Engineers (IEEE) |
| Relação |
IEEE Transactions on Power Systems |
| Direitos |
closedAccess |
| Palavras-Chave | #Combinatorial optimization #mixed binary linear programming problem #multistage transmission expansion planning |
| Tipo |
info:eu-repo/semantics/article |
