Tabu search algorithm for network synthesis
Nenhuma Miniatura disponível
Data
2000-05-01
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
Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.
Descrição
Palavras-chave
Idioma
Inglês
Como citar
IEEE Transactions on Power Systems. New York: IEEE-Inst Electrical Electronics Engineers Inc., v. 15, n. 2, p. 490-495, 2000.
