Meta-heurísticas para o problema de planejamento de expansão da rede de transmissão de energia elétrica considerando restrições de segurança

• Ano de defesa: 2015
• Autor(a) principal: Lemos, Robinson Alves [UNESP]
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Estadual Paulista (Unesp)
• Palavras-chave em Português: Energia eletrica - Transmissão; Redes eletricas; Programação heuristica; Sistemas de energia eletrica - Proteção; Electric power systems Protection
• Link de acesso: http://hdl.handle.net/11449/134105; http://www.athena.biblioteca.unesp.br/exlibris/bd/cathedra/14-01-2016/000857581.pdf

This work deals with the energy network transmission expansion planning problem (TEP) and uses two variations of the CC model on the static planning horizon: with N-1 security constraints (STEPS) and the usual formulation, without security constraints (STEP). The meta-heuristics tabu search (TS), GRASP and iterated local search (ILS) were implemented using the framework ParadisEO and the parameters tunning were made with the aid of paramILS. The algorithms were tested in 42 test systems divided into 6 groups: Garver 6 bars (4 test systems), IEEE 24 bars (10 test systems), 46 South Brazilian bars (4 test systems), Brazilian Southeast 79 bars (4 test systems), Brazilian Northeast 87 bars (8 test systems) and Colombian 93 bars (12 test systems). The tests showed the viability of ParadisEO framework to implement meta-heuristics for the TEP problem. In addition, a large benchmark for use in future STEP and SSTEP works was created.