Benchmark Functions for the CEC’2008 SpecialSession and Competition on LargeScaleGlobalOptimization.pdfVIP

下载本文档

125
0
约1.41万字
约 18页
2017-04-06 发布于江苏
举报
版权申诉

Benchmark Functions for the CEC’2008 SpecialSession and Competition on LargeScaleGlobalOptimization.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Benchmark Functions for the CEC’2008 SpecialSession and Competition on LargeScaleGlobalOptimization

1 Benchmark Functions for the CEC’2008 Special Session and Competition on Large Scale Global Optimization K. Tang1, X. Yao1, 2, P. N. Suganthan3, C. MacNish4, Y. P. Chen5, C. M. Chen5, Z. Yang1 1Nature Inspired Computation and Applications Laboratory (NICAL), Department of Computer Science and Technology, the University of Science and Technology of China, Hefei, Anhui, China 2The Center of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, the University of Birminham, Edgbaston, Birmingham B15 2TT, U.K. 3 School of EEE, Nanyang Technological University, Singapore, 639798 4 School of Computer Science Software Engineering, the University of Western Australia, M002, 35 Stirling Highway, Crawley, Western Australia, 6009 5Natural Computing Laboratory, Department of Computer Science, National Chiao Tung University, Taiwan ketang@, x.yao@cs.bham.ac.uk, epnsugan@.sg, cara@.au, ypchen@nclab.tw, ccming@nclab.tw, zhyuyang@ 2 In the past two decades, different kinds of nature-inspired optimization algorithms have been designed and applied to solve optimization problems, e.g., simulated annealing (SA), evolutionary algorithms (EAs), differential evolution (DE), particle swarm optimization (PSO), Ant Colony Optimisation (ACO), Estimation of Distribution Algorithms (EDA), etc. Although these approaches have shown excellent search abilities when applying to some 30-100 dimensional problems, many of them suffer from the curse of dimensionality, which implies that their performance deteriorates quickly as the dimensionality of search space increases. The reasons appear to be two-fold. First, complexity of the problem usually increases with the size of problem, and a previously successful search strategy may no longer be capable of finding the optimal solution. Second, the solution space of the problem increases exponentially with the problem size, and a more efficient search strategy is re