Chaotic Clonal Selection Algorithm for function optimization

Hongwei Dai, Yu Yang, Cunhua Li
{"title":"Chaotic Clonal Selection Algorithm for function optimization","authors":"Hongwei Dai, Yu Yang, Cunhua Li","doi":"10.1109/EDT.2010.5496611","DOIUrl":null,"url":null,"abstract":"The chaotic initialization and chaotic search are introduced into Clonal Selection Algorithm (CSA) to overcome random antibody initialization and premature convergence problems in traditional CSA. Taking full advantages of the ergodic and stochastic properties of chaotic variables, antibodies with different affinity perform chaotic search to exploit local solution space. Experimental results on test functions demonstrate that the chaotic CSA outperforms the classical clonal selection algorithm.","PeriodicalId":325767,"journal":{"name":"2010 International Conference on E-Health Networking Digital Ecosystems and Technologies (EDT)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on E-Health Networking Digital Ecosystems and Technologies (EDT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDT.2010.5496611","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The chaotic initialization and chaotic search are introduced into Clonal Selection Algorithm (CSA) to overcome random antibody initialization and premature convergence problems in traditional CSA. Taking full advantages of the ergodic and stochastic properties of chaotic variables, antibodies with different affinity perform chaotic search to exploit local solution space. Experimental results on test functions demonstrate that the chaotic CSA outperforms the classical clonal selection algorithm.
用于函数优化的混沌克隆选择算法
在克隆选择算法(CSA)中引入混沌初始化和混沌搜索,克服了传统克隆选择算法中存在的抗体随机初始化和过早收敛问题。不同亲和度的抗体充分利用混沌变量的遍历性和随机性,进行混沌搜索,利用局部解空间。在测试函数上的实验结果表明,混沌CSA优于经典克隆选择算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信