基于群体的多目标人工大猩猩优化算法的无刷直流电机设计优化

IF 1 4区 工程技术 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Compel-The International Journal for Computation and Mathematics in Electrical and Electronic Engineering Pub Date : 2023-10-19 DOI:10.1108/compel-02-2023-0058
Hadjaissa Bensoltane, Zoubida Belli
{"title":"基于群体的多目标人工大猩猩优化算法的无刷直流电机设计优化","authors":"Hadjaissa Bensoltane, Zoubida Belli","doi":"10.1108/compel-02-2023-0058","DOIUrl":null,"url":null,"abstract":"Purpose This paper aims to present a novel multi-objective version of the Gorilla Troops optimizer (GTO), based on crowding distance, to achieve the optimal design of a brushless direct current motor. Design/methodology/approach In the proposed algorithm, the crowding distance technique was integrated into the GTO to perform the leader selection and also for the external archive refinement from extra non-dominated solutions. Furthermore, with a view to improving the diversity of non-dominated solutions in the external archive, mutation operator was used. For constrained problems, an efficient strategy was adopted. The proposed algorithm is referred to as CD-MOGTO. Findings To validate the effectiveness of the proposed approach, it was initially tested on three constrained multi-objective problems; thereafter, it was applied to optimize the design variables of brushless direct current motor to concurrently fulfill six inequality constraints, maximize efficiency and minimize total mass. Originality/value The results revealed the high potential of the proposed algorithm over different recognized algorithms in solving constrained multi-objective issues and the brushless direct current motors.","PeriodicalId":55233,"journal":{"name":"Compel-The International Journal for Computation and Mathematics in Electrical and Electronic Engineering","volume":"68 1","pages":"0"},"PeriodicalIF":1.0000,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Crowding-based multi-objective artificial gorilla troops optimizer for brushless direct current motor design optimization\",\"authors\":\"Hadjaissa Bensoltane, Zoubida Belli\",\"doi\":\"10.1108/compel-02-2023-0058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Purpose This paper aims to present a novel multi-objective version of the Gorilla Troops optimizer (GTO), based on crowding distance, to achieve the optimal design of a brushless direct current motor. Design/methodology/approach In the proposed algorithm, the crowding distance technique was integrated into the GTO to perform the leader selection and also for the external archive refinement from extra non-dominated solutions. Furthermore, with a view to improving the diversity of non-dominated solutions in the external archive, mutation operator was used. For constrained problems, an efficient strategy was adopted. The proposed algorithm is referred to as CD-MOGTO. Findings To validate the effectiveness of the proposed approach, it was initially tested on three constrained multi-objective problems; thereafter, it was applied to optimize the design variables of brushless direct current motor to concurrently fulfill six inequality constraints, maximize efficiency and minimize total mass. Originality/value The results revealed the high potential of the proposed algorithm over different recognized algorithms in solving constrained multi-objective issues and the brushless direct current motors.\",\"PeriodicalId\":55233,\"journal\":{\"name\":\"Compel-The International Journal for Computation and Mathematics in Electrical and Electronic Engineering\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Compel-The International Journal for Computation and Mathematics in Electrical and Electronic Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/compel-02-2023-0058\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Compel-The International Journal for Computation and Mathematics in Electrical and Electronic Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/compel-02-2023-0058","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

摘要提出了一种基于拥挤距离的多目标大猩猩优化算法(GTO),以实现无刷直流电机的优化设计。在提出的算法中,将拥挤距离技术集成到GTO中进行领导者选择,并从额外的非支配解中进行外部存档细化。此外,为了提高外部档案中非支配解的多样性,采用了变异算子。对于约束问题,采用了一种有效的策略。该算法被称为CD-MOGTO。为了验证该方法的有效性,对三个约束多目标问题进行了初步测试;然后,应用该方法对无刷直流电机设计变量进行优化,同时满足6个不等式约束,实现效率最大化和总质量最小化。结果表明,该算法在求解约束多目标问题和无刷直流电机问题方面具有较高的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Crowding-based multi-objective artificial gorilla troops optimizer for brushless direct current motor design optimization
Purpose This paper aims to present a novel multi-objective version of the Gorilla Troops optimizer (GTO), based on crowding distance, to achieve the optimal design of a brushless direct current motor. Design/methodology/approach In the proposed algorithm, the crowding distance technique was integrated into the GTO to perform the leader selection and also for the external archive refinement from extra non-dominated solutions. Furthermore, with a view to improving the diversity of non-dominated solutions in the external archive, mutation operator was used. For constrained problems, an efficient strategy was adopted. The proposed algorithm is referred to as CD-MOGTO. Findings To validate the effectiveness of the proposed approach, it was initially tested on three constrained multi-objective problems; thereafter, it was applied to optimize the design variables of brushless direct current motor to concurrently fulfill six inequality constraints, maximize efficiency and minimize total mass. Originality/value The results revealed the high potential of the proposed algorithm over different recognized algorithms in solving constrained multi-objective issues and the brushless direct current motors.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.60
自引率
0.00%
发文量
124
审稿时长
4.2 months
期刊介绍: COMPEL exists for the discussion and dissemination of computational and analytical methods in electrical and electronic engineering. The main emphasis of papers should be on methods and new techniques, or the application of existing techniques in a novel way. Whilst papers with immediate application to particular engineering problems are welcome, so too are papers that form a basis for further development in the area of study. A double-blind review process ensures the content''s validity and relevance.
期刊最新文献
Refining the physical description of charge trapping and detrapping in a transport model for dielectrics using an optimization algorithm Asymmetric air gap fault detection in linear permanent magnet Vernier machines Development and comparison of double-stator memory machines with parallel hybrid magnets Micromagnetics and multiscale hysteresis simulations of permanent magnets Optimization design of insulation structure of multiwinding high-frequency transformer based on response surface method
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1