A new population initialisation method based on the Pareto 80/20 rule for meta-heuristic optimisation algorithms

IET Softw. Pub Date : 2021-05-05 DOI:10.1049/SFW2.12025
M. Hasanzadeh, F. Keynia
{"title":"A new population initialisation method based on the Pareto 80/20 rule for meta-heuristic optimisation algorithms","authors":"M. Hasanzadeh, F. Keynia","doi":"10.1049/SFW2.12025","DOIUrl":null,"url":null,"abstract":"Farshid Keynia, Department of Energy Management and Optimization, Institute of Science and High Technology and Environmental Sciences, Graduate University of Advanced Technology, Kerman, Iran. Email: f.keynia@kgut.ac.ir Abstract In this research, a new method for population initialisation in meta‐heuristic algorithms based on the Pareto 80/20 rule is presented. The population in a meta‐heuristic algorithm has two important tasks, including pushing the algorithm toward the real optima and preventing the algorithm from trapping in the local optima. Therefore, the starting point of a meta‐heuristic algorithm can have a significant impact on the performance and output results of the algorithm. In this research, using the Pareto 80/20 rule, an innovative and new method for creating an initial population in meta‐heuristic algorithms is presented. In this method, by using elitism, it is possible to increase the convergence of the algorithm toward the global optima, and by using the complete distribution of the population in the search spaces, the algorithm is prevented from trapping in the local optima. In this research, the proposed initialisation method was implemented in comparison with other initialisation methods using the cuckoo search algorithm. In addition, the efficiency and effectiveness of the proposed method in comparison with other well‐ known initialisation methods using statistical tests and in solving a variety of benchmark functions including unimodal, multimodal, fixed dimensional multimodal, and composite functions as well as in solving well‐known engineering problems was confirmed.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"16 1","pages":"323-347"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Softw.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/SFW2.12025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Farshid Keynia, Department of Energy Management and Optimization, Institute of Science and High Technology and Environmental Sciences, Graduate University of Advanced Technology, Kerman, Iran. Email: f.keynia@kgut.ac.ir Abstract In this research, a new method for population initialisation in meta‐heuristic algorithms based on the Pareto 80/20 rule is presented. The population in a meta‐heuristic algorithm has two important tasks, including pushing the algorithm toward the real optima and preventing the algorithm from trapping in the local optima. Therefore, the starting point of a meta‐heuristic algorithm can have a significant impact on the performance and output results of the algorithm. In this research, using the Pareto 80/20 rule, an innovative and new method for creating an initial population in meta‐heuristic algorithms is presented. In this method, by using elitism, it is possible to increase the convergence of the algorithm toward the global optima, and by using the complete distribution of the population in the search spaces, the algorithm is prevented from trapping in the local optima. In this research, the proposed initialisation method was implemented in comparison with other initialisation methods using the cuckoo search algorithm. In addition, the efficiency and effectiveness of the proposed method in comparison with other well‐ known initialisation methods using statistical tests and in solving a variety of benchmark functions including unimodal, multimodal, fixed dimensional multimodal, and composite functions as well as in solving well‐known engineering problems was confirmed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于Pareto 80/20规则的元启发式优化算法种群初始化新方法
Farshid Keynia,伊朗克尔曼先进技术研究生院科学、高技术与环境科学研究所能源管理与优化系摘要本文提出了一种基于Pareto 80/20规则的元启发式算法中群体初始化的新方法。在元启发式算法中,种群有两个重要的任务,即将算法推向真实最优点和防止算法陷入局部最优点。因此,元启发式算法的起点会对算法的性能和输出结果产生重大影响。在这项研究中,利用Pareto 80/20规则,提出了一种在元启发式算法中创建初始种群的创新方法。在该方法中,通过使用精英性,可以提高算法向全局最优的收敛性,并且通过使用种群在搜索空间中的完整分布,可以防止算法陷入局部最优。在本研究中,利用布谷鸟搜索算法与其他初始化方法进行了对比。此外,与使用统计测试的其他众所周知的初始化方法相比,在解决各种基准函数(包括单峰、多峰、固定维多峰和复合函数)以及解决众所周知的工程问题方面,所提出的方法的效率和有效性得到了证实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Prioritising test scripts for the testing of memory bloat in web applications A synergic quantum particle swarm optimisation for constrained combinatorial test generation A hybrid model for prediction of software effort based on team size A 20-year mapping of Bayesian belief networks in software project management Emerging and multidisciplinary approaches to software engineering
×
引用
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