基于OpenMP的并行克隆选择算法

Hongbing Zhu, Sicheng Chen, Jianguo Wu
{"title":"基于OpenMP的并行克隆选择算法","authors":"Hongbing Zhu, Sicheng Chen, Jianguo Wu","doi":"10.1109/ICINIS.2010.41","DOIUrl":null,"url":null,"abstract":"Clonal selection algorithm (CSA) is one of the most representative Immune algorithms (IA) and was applied into the protein structure prediction (PSP) on AB off-lattice model, but it required a long time in the calculation. So in this paper, a parallel clonal selection algorithm (CSA) was proposed, which was implemented using distributed computing model that employed Open MP on four core computer. In the algorithm, several sub-populations replaced the original single population, and each sub-population evolved independently, and the current best individual was distributed into all the sub-populations. The parallel algorithm overcame premature convergence and found global optima efficiently. And the experiment results shown that the performance had beensignificantly improved.","PeriodicalId":319379,"journal":{"name":"2010 Third International Conference on Intelligent Networks and Intelligent Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Paralleling Clonal Selection Algorithm with OpenMP\",\"authors\":\"Hongbing Zhu, Sicheng Chen, Jianguo Wu\",\"doi\":\"10.1109/ICINIS.2010.41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clonal selection algorithm (CSA) is one of the most representative Immune algorithms (IA) and was applied into the protein structure prediction (PSP) on AB off-lattice model, but it required a long time in the calculation. So in this paper, a parallel clonal selection algorithm (CSA) was proposed, which was implemented using distributed computing model that employed Open MP on four core computer. In the algorithm, several sub-populations replaced the original single population, and each sub-population evolved independently, and the current best individual was distributed into all the sub-populations. The parallel algorithm overcame premature convergence and found global optima efficiently. And the experiment results shown that the performance had beensignificantly improved.\",\"PeriodicalId\":319379,\"journal\":{\"name\":\"2010 Third International Conference on Intelligent Networks and Intelligent Systems\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Conference on Intelligent Networks and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICINIS.2010.41\",\"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 Third International Conference on Intelligent Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINIS.2010.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

克隆选择算法(CSA)是最具代表性的免疫算法(IA)之一,已应用于AB离晶格模型的蛋白质结构预测(PSP),但其计算时间较长。为此,本文提出了一种并行克隆选择算法(CSA),并在四核计算机上采用Open MP分布式计算模型实现该算法。在该算法中,多个子种群取代原有的单个种群,每个子种群独立进化,并将当前最优个体分配到所有子种群中。并行算法克服了早熟收敛,有效地找到了全局最优解。实验结果表明,该系统的性能得到了显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Paralleling Clonal Selection Algorithm with OpenMP
Clonal selection algorithm (CSA) is one of the most representative Immune algorithms (IA) and was applied into the protein structure prediction (PSP) on AB off-lattice model, but it required a long time in the calculation. So in this paper, a parallel clonal selection algorithm (CSA) was proposed, which was implemented using distributed computing model that employed Open MP on four core computer. In the algorithm, several sub-populations replaced the original single population, and each sub-population evolved independently, and the current best individual was distributed into all the sub-populations. The parallel algorithm overcame premature convergence and found global optima efficiently. And the experiment results shown that the performance had beensignificantly improved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信