Optimization of Yagi array by hierarchical genetic algorithms

H.J. Wang, K. Man, C. Chan, K. M. Luk
{"title":"Optimization of Yagi array by hierarchical genetic algorithms","authors":"H.J. Wang, K. Man, C. Chan, K. M. Luk","doi":"10.1109/RAWCON.2003.1227900","DOIUrl":null,"url":null,"abstract":"A method of hierarchical genetic algorithms (HGA) is used for optimizing the element spacing and lengths of Yagi-Uda antennas. This scheme has the ability of handling multiobjective functions as well as the discrete constraints in the numerical optimizing process. Together with the technique of Pareto ranking scheme, more than one possible solution can be obtained. It has been found that the number of dipoles of the antenna can be minimally identified with multi-facet design criteria as well as the imposed stringent constraints on the antenna design. Furthermore, this added feature also enables a design tradeoff between cost and performance without extra computational effort.","PeriodicalId":177645,"journal":{"name":"Radio and Wireless Conference, 2003. RAWCON '03. Proceedings","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Radio and Wireless Conference, 2003. RAWCON '03. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAWCON.2003.1227900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

A method of hierarchical genetic algorithms (HGA) is used for optimizing the element spacing and lengths of Yagi-Uda antennas. This scheme has the ability of handling multiobjective functions as well as the discrete constraints in the numerical optimizing process. Together with the technique of Pareto ranking scheme, more than one possible solution can be obtained. It has been found that the number of dipoles of the antenna can be minimally identified with multi-facet design criteria as well as the imposed stringent constraints on the antenna design. Furthermore, this added feature also enables a design tradeoff between cost and performance without extra computational effort.
基于层次遗传算法的八木阵列优化
采用层次遗传算法(HGA)优化Yagi-Uda天线的单元间距和长度。该方法能够处理数值优化过程中的多目标函数和离散约束。结合Pareto排序方案技术,可以得到一个以上的可能解。研究发现,天线的偶极子数可以用多面设计准则以及对天线设计施加的严格约束来最小限度地识别。此外,这个添加的功能还可以在成本和性能之间进行设计权衡,而无需额外的计算工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信