Publicação: A Strategy to Solve the Multistage Transmission Expansion Planning Problem
Carregando...
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Institute of Electrical and Electronics Engineers (IEEE)
Tipo
Artigo
Direito de acesso
Acesso restrito
Resumo
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.
Descrição
Palavras-chave
Combinatorial optimization, mixed binary linear programming problem, multistage transmission expansion planning
Idioma
Inglês
Como citar
IEEE Transactions on Power Systems. Piscataway: IEEE-Inst Electrical Electronics Engineers Inc, v. 26, n. 4, p. 2574-2576, 2011.
