QQ客服 官方微博 反馈留言

	Dynamic Search Fireworks Algorithm with Covariance Mutation for Solving the CEC 2015 Learning Based Competition Problems
	Yu, Chao ; Kelley, Ling Chen ; Tan, Ying
	2015
英文摘要	As a revolutionary swarm intelligence algorithm, fireworks algorithm (FWA) is designed to solve optimization problems. In this paper, the dynamic fireworks algorithm with covariance mutation (dynFWACM) is proposed. After applying the explosion operator, the mutation operator is introduced, which calculates the mean value and covariance matrix of the better sparks and produces sparks according with Gaussian distribution. DynFWACM is compared with the most advanced fireworks algorithms to proof its effectiveness. In addition, 15 functions of CEC 2015 competition on learning based real-parameter single objective optimization are used to test the performance of our new proposed algorithm. The experimental results show that dynFWACM outperforms both AFWA and dynFWA, as well as the experimental results of the 15 functions given.; CPCI-S(ISTP); chaoyu@pku.edu.cn; lingchenkelley@gmail.com; ytan@pku.edu.cn; 1106-1112
语种	英语
出处	IEEE Congress on Evolutionary Computation (CEC)
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/460586]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Yu, Chao,Kelley, Ling Chen,Tan, Ying. Dynamic Search Fireworks Algorithm with Covariance Mutation for Solving the CEC 2015 Learning Based Competition Problems. 2015-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。