Incorporating mutation scheme into krill herd algorithm for global numerical optimization
文献类型:期刊论文
作者 | Li J.; Li J.; Liu L.; Liu L.; Li J. |
刊名 | Neural Computing & Applications |
出版日期 | 2014 |
卷号 | 24期号:3-4页码:853-871 |
ISSN号 | ISBN/0941-0643 |
英文摘要 | Recently, Gandomi and Alavi proposed a robust meta-heuristic optimization algorithm, called Krill Herd (KH), for global optimization. To improve the performance of the KH algorithm, harmony search (HS) is applied to mutate between krill during the process of krill updating instead of physical diffusion used in KH. A novel hybrid meta-heuristic optimization approach HS/KH is proposed to solve global numerical optimization problem. HS/KH combines the exploration of harmony search (HS) with the exploitation of KH effectively, and hence, it can generate the promising candidate solutions. The detailed implementation procedure for this improved meta-heuristic method is also described. Fourteen standard benchmark functions are applied to verify the effects of these improvements, and it is demonstrated that, in most cases, the performance of this hybrid meta-heuristic method (HS/KH) is superior to, or at least highly competitive with, the standard KH and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, HS, KH, PSO, and SGA. The effect of the HS/FA parameters is also analyzed. |
收录类别 | SCI ; EI |
语种 | 英语 |
源URL | [http://ir.ciomp.ac.cn/handle/181722/44074] |
专题 | 长春光学精密机械与物理研究所_中科院长春光机所知识产出 |
推荐引用方式 GB/T 7714 | Li J.,Li J.,Liu L.,et al. Incorporating mutation scheme into krill herd algorithm for global numerical optimization[J]. Neural Computing & Applications,2014,24(3-4):853-871. |
APA | Li J.,Li J.,Liu L.,Liu L.,&Li J..(2014).Incorporating mutation scheme into krill herd algorithm for global numerical optimization.Neural Computing & Applications,24(3-4),853-871. |
MLA | Li J.,et al."Incorporating mutation scheme into krill herd algorithm for global numerical optimization".Neural Computing & Applications 24.3-4(2014):853-871. |
入库方式: OAI收割
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。