Firefly algorithm with chaos

被引：687

作者：

Gandomi, A. H. ^{[2
]}

Yang, X-S. ^{[3
]}

Talatahari, S. ^{[1
]}

Alavi, A. H. ^{[4
]}

机构：

[1] Univ Tabriz, Marand Fac Engn, Tabriz, Iran

[2] Islamic Azad Univ, Cent Tehran Branch, Tehran, Iran

[3] Univ Cambridge, Dept Engn, Cambridge CB2 1PZ, England

[4] Iran Univ Sci & Technol, Dept Civil Engn, Tehran, Iran

来源：

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION | 2013年 / 18卷 / 01期

关键词：

Firefly algorithm; Chaos; Metaheuristic algorithm; Global optimization; OPTIMIZATION;

D O I：

10.1016/j.cnsns.2012.06.009

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A recently developed metaheuristic optimization algorithm, firefly algorithm (FA), mimics the social behavior of fireflies based on the flashing and attraction characteristics of fireflies. In the present study, we will introduce chaos into FA so as to increase its global search mobility for robust global optimization. Detailed studies are carried out on benchmark problems with different chaotic maps. Here, 12 different chaotic maps are utilized to tune the attractive movement of the fireflies in the algorithm. The results show that some chaotic FAs can clearly outperform the standard FA. (c) 2012 Elsevier B.V. All rights reserved.

引用

页码：89 / 98

页数：10

共 27 条

[1] Uniform Big Bang-Chaotic Big Crunch optimization [J].