混沌免疫克隆选择算法及其应用

Hongwei Dai, Cunhua Li
{"title":"混沌免疫克隆选择算法及其应用","authors":"Hongwei Dai, Cunhua Li","doi":"10.1109/KAM.2009.85","DOIUrl":null,"url":null,"abstract":"Immune Clonal Selection Algorithm (ICSA), based on the clonal selection theory proposed by Burnet, has gained much attention in the last decade. ICSA can exploit and explore the solution space in parallel and effectively. However, antibody random initialization and premature convergence are two problems of ICSA. To solve these problems, chaotic initialization mechanism and quantum interference mechanism are introduced into ICSA. Simulation results based on the traveling salesman problems have demonstrated the efficiency and robustness of the novel Clonal Selection Algorithm.","PeriodicalId":192986,"journal":{"name":"2009 Second International Symposium on Knowledge Acquisition and Modeling","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Chaotic Immune Clonal Selection Algorithm and Its Application\",\"authors\":\"Hongwei Dai, Cunhua Li\",\"doi\":\"10.1109/KAM.2009.85\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Immune Clonal Selection Algorithm (ICSA), based on the clonal selection theory proposed by Burnet, has gained much attention in the last decade. ICSA can exploit and explore the solution space in parallel and effectively. However, antibody random initialization and premature convergence are two problems of ICSA. To solve these problems, chaotic initialization mechanism and quantum interference mechanism are introduced into ICSA. Simulation results based on the traveling salesman problems have demonstrated the efficiency and robustness of the novel Clonal Selection Algorithm.\",\"PeriodicalId\":192986,\"journal\":{\"name\":\"2009 Second International Symposium on Knowledge Acquisition and Modeling\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Second International Symposium on Knowledge Acquisition and Modeling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KAM.2009.85\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Second International Symposium on Knowledge Acquisition and Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KAM.2009.85","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

基于Burnet提出的克隆选择理论的免疫克隆选择算法(Immune Clonal Selection Algorithm, ICSA)在近十年来得到了广泛的关注。ICSA可以并行有效地开发和探索解决方案空间。然而,抗体随机初始化和过早收敛是ICSA存在的两个问题。为了解决这些问题,引入了混沌初始化机制和量子干涉机制。基于旅行商问题的仿真结果证明了该算法的有效性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Chaotic Immune Clonal Selection Algorithm and Its Application
Immune Clonal Selection Algorithm (ICSA), based on the clonal selection theory proposed by Burnet, has gained much attention in the last decade. ICSA can exploit and explore the solution space in parallel and effectively. However, antibody random initialization and premature convergence are two problems of ICSA. To solve these problems, chaotic initialization mechanism and quantum interference mechanism are introduced into ICSA. Simulation results based on the traveling salesman problems have demonstrated the efficiency and robustness of the novel Clonal Selection Algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reduction Methods of Attributes Based on Improved BPSO A Novel Program Analysis Method Based on Execution Path Correlation A New Repeat Family Detection Method Based on Sparse de Bruijn Graph Extracting Event Temporal Information Based on Web Application of Ant Colony Algorithm in Discrete Job-Shop Scheduling
×
引用
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