Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/1421
Título: Ant colony search algorithm for the optimal power flow problem
Autor: Soares, João
Sousa, Tiago
Vale, Zita
Morais, H.
Faria, Pedro
Palavras-chave: Ant colony search
Artificial intelligence
Economic dispatch
Optimal power flow
Optimization method
Data: 2011
Editora: IEEE
Resumo: To maintain a power system within operation limits, a level ahead planning it is necessary to apply competitive techniques to solve the optimal power flow (OPF). OPF is a non-linear and a large combinatorial problem. The Ant Colony Search (ACS) optimization algorithm is inspired by the organized natural movement of real ants and has been successfully applied to different large combinatorial optimization problems. This paper presents an implementation of Ant Colony optimization to solve the OPF in an economic dispatch context. The proposed methodology has been developed to be used for maintenance and repairing planning with 48 to 24 hours antecipation. The main advantage of this method is its low execution time that allows the use of OPF when a large set of scenarios has to be analyzed. The paper includes a case study using the IEEE 30 bus network. The results are compared with other well-known methodologies presented in the literature.
URI: http://hdl.handle.net/10400.22/1421
ISBN: 978-1-4577-1000-1
ISSN: 978-1-4577-1001-8
Versão do Editor: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6039840
Aparece nas colecções:ISEP – GECAD – Comunicações em eventos científicos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
COM_JSousa_2011_GECAD.pdf651,18 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.