多模态优化的一种带有行为划分的聚类进化算法

Yaming Bo, B. Liu
{"title":"多模态优化的一种带有行为划分的聚类进化算法","authors":"Yaming Bo, B. Liu","doi":"10.1109/ICNNSP.2008.4590382","DOIUrl":null,"url":null,"abstract":"In this paper, a novel evolutionary algorithm (EA) with two groups is presented based on the mimicry of a two-group team for a specific objective. The operations of exploration and epitome-based learning behaviors are properly defined. By means of the inherited generation of new individual and the replacement rules of the team, the behavior division between the elite group and the plain group is established, which make the algorithm have the potential for adaptive local, global and directive search. The conflict between the successful global search and the fast convergence in some other algorithms can be obviously mitigated in this algorithm. It can be shown by the comparisons that the presented algorithm is statistically superior to the genetic algorithm and particle swarm optimization in both global optimization and computational cost for multimodal optimization.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"An epitome-based evolutionary algorithm with behavior division for multimodal optimizations\",\"authors\":\"Yaming Bo, B. Liu\",\"doi\":\"10.1109/ICNNSP.2008.4590382\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a novel evolutionary algorithm (EA) with two groups is presented based on the mimicry of a two-group team for a specific objective. The operations of exploration and epitome-based learning behaviors are properly defined. By means of the inherited generation of new individual and the replacement rules of the team, the behavior division between the elite group and the plain group is established, which make the algorithm have the potential for adaptive local, global and directive search. The conflict between the successful global search and the fast convergence in some other algorithms can be obviously mitigated in this algorithm. It can be shown by the comparisons that the presented algorithm is statistically superior to the genetic algorithm and particle swarm optimization in both global optimization and computational cost for multimodal optimization.\",\"PeriodicalId\":250993,\"journal\":{\"name\":\"2008 International Conference on Neural Networks and Signal Processing\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Neural Networks and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNNSP.2008.4590382\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Neural Networks and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNNSP.2008.4590382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

本文提出了一种基于两组团队对特定目标的模仿的两组进化算法。正确定义了探索和基于缩影的学习行为的操作。通过新个体的遗传生成和团队的替换规则,建立了精英群体和普通群体的行为划分,使算法具有自适应局部搜索、全局搜索和定向搜索的潜力。该算法可以明显缓解其他算法全局搜索成功与快速收敛之间的矛盾。结果表明,该算法在全局寻优和计算量方面均优于遗传算法和粒子群算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An epitome-based evolutionary algorithm with behavior division for multimodal optimizations
In this paper, a novel evolutionary algorithm (EA) with two groups is presented based on the mimicry of a two-group team for a specific objective. The operations of exploration and epitome-based learning behaviors are properly defined. By means of the inherited generation of new individual and the replacement rules of the team, the behavior division between the elite group and the plain group is established, which make the algorithm have the potential for adaptive local, global and directive search. The conflict between the successful global search and the fast convergence in some other algorithms can be obviously mitigated in this algorithm. It can be shown by the comparisons that the presented algorithm is statistically superior to the genetic algorithm and particle swarm optimization in both global optimization and computational cost for multimodal optimization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信