The Influence of Noise on Multi-Parent Crossover for an Island Model Genetic Algorithm

Brahim Aboutaib, Andrew M. Sutton
{"title":"The Influence of Noise on Multi-Parent Crossover for an Island Model Genetic Algorithm","authors":"Brahim Aboutaib, Andrew M. Sutton","doi":"10.1145/3630638","DOIUrl":null,"url":null,"abstract":"Many optimization problems tackled by evolutionary algorithms are not only computationally expensive, but also complicated with one or more sources of noise. One technique to deal with high computational overhead is parallelization. However, though the existing literature gives good insights about the expected behavior of parallelized evolutionary algorithms, we still lack an understanding of their performance in the presence of noise. This paper considers how parallelization might be leveraged together with multi-parent crossover in order to handle noisy problems. We present a rigorous running time analysis of an island model with weakly connected topology tasked with hill climbing in the presence of general additive noise (i.e., noisy OneMax ). Our proofs yield insights into the relationship between the noise intensity and number of required parents. We translate this into positive and negative results for two kinds of multi-parent crossover operators. We then empirically analyze and extend this framework to investigate the trade-offs between noise impact, optimization time, and limits of computation power to deal with noise.","PeriodicalId":497392,"journal":{"name":"ACM transactions on evolutionary learning","volume":" 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM transactions on evolutionary learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3630638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Many optimization problems tackled by evolutionary algorithms are not only computationally expensive, but also complicated with one or more sources of noise. One technique to deal with high computational overhead is parallelization. However, though the existing literature gives good insights about the expected behavior of parallelized evolutionary algorithms, we still lack an understanding of their performance in the presence of noise. This paper considers how parallelization might be leveraged together with multi-parent crossover in order to handle noisy problems. We present a rigorous running time analysis of an island model with weakly connected topology tasked with hill climbing in the presence of general additive noise (i.e., noisy OneMax ). Our proofs yield insights into the relationship between the noise intensity and number of required parents. We translate this into positive and negative results for two kinds of multi-parent crossover operators. We then empirically analyze and extend this framework to investigate the trade-offs between noise impact, optimization time, and limits of computation power to deal with noise.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
岛屿模型遗传算法中噪声对多亲本交叉的影响
进化算法解决的许多优化问题不仅计算成本高,而且具有一个或多个噪声源。处理高计算开销的一种技术是并行化。然而,尽管现有的文献对并行进化算法的预期行为给出了很好的见解,但我们仍然缺乏对它们在噪声存在下的性能的理解。本文考虑了如何利用并行化和多父交叉来处理噪声问题。我们提出了一个具有弱连接拓扑的岛模型的严格运行时间分析,该模型在一般加性噪声(即嘈杂的OneMax)的存在下具有爬坡任务。我们的证据对噪音强度和所需父母数量之间的关系产生了深刻的见解。我们将其转化为两种多父交叉算子的正负结果。然后,我们对该框架进行了实证分析和扩展,以研究噪声影响、优化时间和处理噪声的计算能力限制之间的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolutionary Seeding of Diverse Structural Design Solutions via Topology Optimization The Influence of Noise on Multi-Parent Crossover for an Island Model Genetic Algorithm Model-based Gradient Search for Permutation Problems Exploring the Explainable Aspects and Performance of a Learnable Evolutionary Multiobjective Optimization Method Editorial to the “Evolutionary Reinforcement Learning” Special Issue
×
引用
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