返回
CABC-CSA: a new chaotic hybrid algorithm for solving optimization problems
DOI:10.1007/s11071-013-0802-2.png)
摘要
En 中文
Recently a lot of methods have been presented for solving optimization problems. In this paper, we are trying to propose a new hybrid algorithm for solving these kinds of problem. The proposed algorithm is based on chaotic artificial bee colony and chaotic simulated annealing, CABC-CSA. The chaotic artificial bee colony finds new locations chaotically. Actually, the proposed algorithm provides a combination of local search accuracy of simulated annealing and the ability of global search of artificial bee colony. Furthermore, we used a different method for generating the initial population. The proposed algorithm is validated using 12 benchmark functions. The results are compared with those of the artificial bees' algorithm, the hybrid algorithm of artificial bee colony and simulated annealing and particle swarm optimization. Simulation results show the efficiency of the proposed algorithm.
Keyword:
Artificial bee colony
Simulated annealing
Chaos theory
Optimization algorithms
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
1.4W
被引数:
4.1W
机构
引用论文
A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm一种强大而有效的数值函数优化算法: 人工蜂群 (ABC) 算法

