Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/1585
Título: | A multi-objective evolutionary algorithm based on decomposition for optimal design of Yagi-Uda antennas. |
Autor(es): | Carvalho, Rodrigo de Saldanha, Rodney Rezende Gomes, B. N. Lisboa, Adriano Chaves Alexandre, Xavier Martins |
Palavras-chave: | Multi-objective optimization Decomposition problem Designing Yagi-U da antenna |
Data do documento: | 2012 |
Referência: | CARVALHO, R. de et al. A multi-objective evolutionary algorithm based on decomposition for optimal design of Yagi-Uda antennas. IEEE Transactions on Magnetic, v. 48, n.2, p. 803-806, 2012. Disponível em: <http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6136618>. Acesso em: 10 out. 2012. |
Resumo: | This paper presents a multi-objective evol utionary algorithm based on decomposition (MOEA/D) to design broadband optimal Yagi-Uda antennas. A multi-objective problem is formulated to achieve maximum directivity, minimum voltage standing wave ratio and maximum front-to-back ratio. The algorithm was applied to th e design of optimal 3 to 10 elements Yagi-Uda antennas, whose optimal Pareto fronts are provided in a single picture. The multi-o bjective problem is decomposed by Chebyshev decomposition, and it is solved by differential evolution (DE) and Gaussian mutation op erators in order to provide a better approximation of the Pareto front. The results show that the implemented MOEA/D is ef fi cient for designing Yagi-Uda antennas. |
URI: | http://www.repositorio.ufop.br/handle/123456789/1585 |
Link para o artigo: | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6136618 |
ISSN: | 00189464 |
Aparece nas coleções: | DECEA - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_MultiObjectiveEvolutionary.pdf | 617,51 kB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.