QQ客服 官方微博 反馈留言

	Dynamic search in fireworks algorithm
	Zheng, Shaoqiu ; Janecek, Andreas ; Li, Junzhi ; Tan, Ying
	2014
英文摘要	We propose an improved version of the recently developed Enhanced Fireworks Algorithm (EFWA) based on an adaptive dynamic local search mechanism. In EFWA, the explosion amplitude (i.e., search area around the current location) of each firework is computed based on the quality of the firework's current location. This explosion amplitude is limited by a lower bound which decreases with the number of iterations in order to avoid the explosion amplitude to be [close to] zero, and in order to enhance global search abilities at the beginning and local search abilities towards the later phase of the algorithm. As the explosion amplitude in EFWA depends solely on the fireworks' fitness and the current number of iterations, this procedure does not allow for an adaptive optimization process. To deal with these limitations, we propose the Dynamic Search Fireworks Algorithm (dynFWA) which uses a dynamic explosion amplitude for the firework at the currently best position. If the fitness of the best firework could be improved, the explosion amplitude will increase in order to speed up convergence. On the contrary, if the current position of the best firework could not be improved, the explosion amplitude will decrease in order to narrow the search area. In addition, we show that one of the EFWA operators can be removed in dynFWA without a loss in accuracy - this makes dynFWA computationally more efficient than EFWA. Experiments on 28 benchmark functions indicate that dynFWA is able to significantly outperform EFWA, and achieves better performance than the latest SPSO version SPSO2011. ? 2014 IEEE.; EI; CPCI-S(ISTP); 0
语种	英语
DOI标识	10.1109/CEC.2014.6900485
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/295143]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Zheng, Shaoqiu,Janecek, Andreas,Li, Junzhi,et al. Dynamic search in fireworks algorithm. 2014-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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