一种基于宗族竞争的混合遗传算法

Weihong Zhou, Shun-Qing Xiong, L. Ying
{"title":"一种基于宗族竞争的混合遗传算法","authors":"Weihong Zhou, Shun-Qing Xiong, L. Ying","doi":"10.1109/YCICT.2010.5713153","DOIUrl":null,"url":null,"abstract":"It is difficult for basic genetic algorithm and evolutionary programming algorithm to converge at global optimal solution of real-continual function in practice, although both of the algorithms have the ability for getting the global optimal solution with convergent probabilities 1 in theory. In this paper, a new hybrid genetic algorithm based on clan competition is proposed, and it is proved that the probability of the new algorithm convegent to the global optimal solution is 1, Numerical experiments results illustrate that, compared with the former two algorithms, the new algorithm is the robustest among the three algorithms, what's more, it has the highest precision with the equal parameters.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new hybrid genetic algorithm based on clan competition\",\"authors\":\"Weihong Zhou, Shun-Qing Xiong, L. Ying\",\"doi\":\"10.1109/YCICT.2010.5713153\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is difficult for basic genetic algorithm and evolutionary programming algorithm to converge at global optimal solution of real-continual function in practice, although both of the algorithms have the ability for getting the global optimal solution with convergent probabilities 1 in theory. In this paper, a new hybrid genetic algorithm based on clan competition is proposed, and it is proved that the probability of the new algorithm convegent to the global optimal solution is 1, Numerical experiments results illustrate that, compared with the former two algorithms, the new algorithm is the robustest among the three algorithms, what's more, it has the highest precision with the equal parameters.\",\"PeriodicalId\":179847,\"journal\":{\"name\":\"2010 IEEE Youth Conference on Information, Computing and Telecommunications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Youth Conference on Information, Computing and Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YCICT.2010.5713153\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2010.5713153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基本遗传算法和进化规划算法在实践中难以收敛于实连续函数的全局最优解,尽管这两种算法在理论上都具有收敛概率为1的全局最优解能力。本文提出了一种新的基于族竞争的混合遗传算法,并证明了新算法收敛到全局最优解的概率为1,数值实验结果表明,与前两种算法相比,新算法是三种算法中最鲁棒的,并且在等参数下具有最高的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A new hybrid genetic algorithm based on clan competition
It is difficult for basic genetic algorithm and evolutionary programming algorithm to converge at global optimal solution of real-continual function in practice, although both of the algorithms have the ability for getting the global optimal solution with convergent probabilities 1 in theory. In this paper, a new hybrid genetic algorithm based on clan competition is proposed, and it is proved that the probability of the new algorithm convegent to the global optimal solution is 1, Numerical experiments results illustrate that, compared with the former two algorithms, the new algorithm is the robustest among the three algorithms, what's more, it has the highest precision with the equal parameters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic channel allocation based on genetic algorith in TD-SCDMA system A distributed coding protocol for wireless relay networks A differential evolution optimized fuzzy clustering algorithm with adaptive adjusting strategy Optimization of water allocation based on the economic loss analysis under different drought scenarios City traffic flow character analysis and origin-destination estimation based on data mining
×
引用
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