S. Chamaani, S. A. Mirtaheri, M. Teshnehlab, M. A. Shooredeli
{"title":"Modified Multi-objective Particle Swarm Optimization for electromagnetic absorber design","authors":"S. Chamaani, S. A. Mirtaheri, M. Teshnehlab, M. A. Shooredeli","doi":"10.1109/APACE.2007.4603923","DOIUrl":null,"url":null,"abstract":"Use of multi-objective particle swarm optimization for designing of planar multilayered electromagnetic absorbers and finding optimal Pareto front is described. The achieved Pareto presents optimal possible trade offs between thickness and reflection coefficient of absorbers. Particle swarm optimization method in comparison with most of optimization algorithms such as genetic algorithms is simple and fast. But the basic form of multi-objective particle swarm optimization may not obtain the best Pareto. We applied some modifications to make it more efficient in finding optimal Pareto front. Comparison with reported results in previous articles confirms the ability of this algorithm in finding better solutions.","PeriodicalId":356424,"journal":{"name":"2007 Asia-Pacific Conference on Applied Electromagnetics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"77","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Asia-Pacific Conference on Applied Electromagnetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APACE.2007.4603923","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 77
Abstract
Use of multi-objective particle swarm optimization for designing of planar multilayered electromagnetic absorbers and finding optimal Pareto front is described. The achieved Pareto presents optimal possible trade offs between thickness and reflection coefficient of absorbers. Particle swarm optimization method in comparison with most of optimization algorithms such as genetic algorithms is simple and fast. But the basic form of multi-objective particle swarm optimization may not obtain the best Pareto. We applied some modifications to make it more efficient in finding optimal Pareto front. Comparison with reported results in previous articles confirms the ability of this algorithm in finding better solutions.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
