基于聚类协同进化的高维问题差分进化

Shuzhen Wan
{"title":"基于聚类协同进化的高维问题差分进化","authors":"Shuzhen Wan","doi":"10.1109/ISCC-C.2013.64","DOIUrl":null,"url":null,"abstract":"Recently, evolutionary algorithms have been successful to solve many optimization problems. However, their performance will deteriorate when applied to complex high-dimensional problems. A clustering-cooperative coevolution scheme was introduced into DE algorithm to tackle the high-dimensional problems. In the scheme, the clustering method has been employed to decompose the problem, which works well with the cooperative coevolution. The proposed algorithm is evaluated by MPB and CEC09 benchmark functions with expanded dimension. The results are very promising, which show clearly that our proposed algorithm is effective for dynamic high-dimensional optimization problems.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Differential Evolution with Clustering Cooperative Coevolution for High-Dimensional Problems\",\"authors\":\"Shuzhen Wan\",\"doi\":\"10.1109/ISCC-C.2013.64\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, evolutionary algorithms have been successful to solve many optimization problems. However, their performance will deteriorate when applied to complex high-dimensional problems. A clustering-cooperative coevolution scheme was introduced into DE algorithm to tackle the high-dimensional problems. In the scheme, the clustering method has been employed to decompose the problem, which works well with the cooperative coevolution. The proposed algorithm is evaluated by MPB and CEC09 benchmark functions with expanded dimension. The results are very promising, which show clearly that our proposed algorithm is effective for dynamic high-dimensional optimization problems.\",\"PeriodicalId\":313511,\"journal\":{\"name\":\"2013 International Conference on Information Science and Cloud Computing Companion\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Information Science and Cloud Computing Companion\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC-C.2013.64\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Science and Cloud Computing Companion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC-C.2013.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

近年来,进化算法已经成功地解决了许多优化问题。然而,当应用于复杂的高维问题时,它们的性能会下降。为解决高维问题,在DE算法中引入了聚类-协作协同进化方案。该方案采用聚类方法对问题进行分解,很好地配合了协同进化。采用扩展维数的MPB和CEC09基准函数对算法进行了评价。结果表明,本文提出的算法对动态高维优化问题是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Differential Evolution with Clustering Cooperative Coevolution for High-Dimensional Problems
Recently, evolutionary algorithms have been successful to solve many optimization problems. However, their performance will deteriorate when applied to complex high-dimensional problems. A clustering-cooperative coevolution scheme was introduced into DE algorithm to tackle the high-dimensional problems. In the scheme, the clustering method has been employed to decompose the problem, which works well with the cooperative coevolution. The proposed algorithm is evaluated by MPB and CEC09 benchmark functions with expanded dimension. The results are very promising, which show clearly that our proposed algorithm is effective for dynamic high-dimensional optimization problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Commercial Bank Stress Tests Based on Credit Risk An Instant-Based Qur'an Memorizer Application Interface Optimization of PID Parameters Based on Improved Particle-Swarm-Optimization The Universal Approximation Capabilities of 2pi-Periodic Approximate Identity Neural Networks Survey of Cloud Messaging Push Notification Service
×
引用
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