Knowledge Sharing in Cooperative Compact Genetic Algorithm

Orakanya Gateratanakul, P. Chongstitvatana
{"title":"Knowledge Sharing in Cooperative Compact Genetic Algorithm","authors":"Orakanya Gateratanakul, P. Chongstitvatana","doi":"10.1109/CCOMS.2018.8463341","DOIUrl":null,"url":null,"abstract":"In this study, we present three methods of sharing knowledge between cooperative compact genetic algorithms. The methods exploit the effect of the worse solutions of the two-cooperative compact genetic algorithms to the search space which can prevent premature convergence. The benefit also encourages exploring other areas in solution space which enhance the opportunity to discover the better solutions. The proposed algorithm has a simple structure requires much less execution time than the non-sharing compact genetic algorithm.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCOMS.2018.8463341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this study, we present three methods of sharing knowledge between cooperative compact genetic algorithms. The methods exploit the effect of the worse solutions of the two-cooperative compact genetic algorithms to the search space which can prevent premature convergence. The benefit also encourages exploring other areas in solution space which enhance the opportunity to discover the better solutions. The proposed algorithm has a simple structure requires much less execution time than the non-sharing compact genetic algorithm.
协作紧凑遗传算法中的知识共享
在本研究中,我们提出了三种协作紧凑遗传算法之间的知识共享方法。该方法利用了双合作紧凑遗传算法的劣解对搜索空间的影响,防止了算法的过早收敛。这种好处还鼓励在解决方案空间中探索其他领域,从而增加发现更好解决方案的机会。该算法结构简单,执行时间比非共享紧凑遗传算法短得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信