Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/1376
Título: Simulated annealing metaheuristic to solve the optimal power flow
Autor: Sousa, Tiago
Soares, João
Vale, Zita
Morais, H.
Faria, Pedro
Palavras-chave: Artificial intelligence
Economic dispatch
Optimal power flow
Optimization method
Simulated annealing
Data: 2011
Editora: IEEE
Resumo: The optimal power flow problem has been widely studied in order to improve power systems operation and planning. For real power systems, the problem is formulated as a non-linear and as a large combinatorial problem. The first approaches used to solve this problem were based on mathematical methods which required huge computational efforts. Lately, artificial intelligence techniques, such as metaheuristics based on biological processes, were adopted. Metaheuristics require lower computational resources, which is a clear advantage for addressing the problem in large power systems. This paper proposes a methodology to solve optimal power flow on economic dispatch context using a Simulated Annealing algorithm inspired on the cooling temperature process seen in metallurgy. The main contribution of the proposed method is the specific neighborhood generation according to the optimal power flow problem characteristics. The proposed methodology has been tested with IEEE 6 bus and 30 bus networks. The obtained results are compared with other wellknown methodologies presented in the literature, showing the effectiveness of the proposed method.
URI: http://hdl.handle.net/10400.22/1376
ISBN: 978-1-4577-1000-1
ISSN: 1944-9925
Versão do Editor: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6039543
Aparece nas colecções:ISEP – GECAD – Comunicações em eventos científicos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
COM_TSousa_2011_GECAD.pdf653,37 kBAdobe PDFVer/Abrir    Acesso Restrito. Solicitar cópia ao autor!

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.