2009
DOI: 10.1007/978-3-642-04441-0_8
|View full text |Cite
|
Sign up to set email alerts
|

Firefly Algorithm for Continuous Constrained Optimization Tasks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
174
0
8

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 314 publications
(182 citation statements)
references
References 13 publications
0
174
0
8
Order By: Relevance
“…Although biology does not have a complete knowledge to determine all the utilities that firefly luminescence can bring to, at least three functions have been identified (Lukasik & Zak, 2009;Yang, 2008): (i) as a communication tool and appeal to potential partners in the reproduction, (ii) as a bait to lure prey for the firefly, (iii) as a warning mechanism for potential predators reminding them that fireflies have a bitter taste.…”
Section: Firefly Colony Algorithm -Fcamentioning
confidence: 99%
See 1 more Smart Citation
“…Although biology does not have a complete knowledge to determine all the utilities that firefly luminescence can bring to, at least three functions have been identified (Lukasik & Zak, 2009;Yang, 2008): (i) as a communication tool and appeal to potential partners in the reproduction, (ii) as a bait to lure prey for the firefly, (iii) as a warning mechanism for potential predators reminding them that fireflies have a bitter taste.…”
Section: Firefly Colony Algorithm -Fcamentioning
confidence: 99%
“…Each member of the swarm explores the problem space taking into account results obtained by others, still applying its own randomized moves as well. The influence of other solutions is controlled by the value of attractiveness (Lukasik & Zak, 2009). …”
Section: Firefly Colony Algorithm -Fcamentioning
confidence: 99%
“…Firefly algorithm, developed by Yang (2008), is a new population-based technique for solving optimization problem, especially for NP-hard problems, and has been motivated by the simulation of the social behavior of fireflies. Lukasik and Zak (2009) use the firefly algorithm for continuous constrained optimization. Their computational experiments show the efficiency of the firefly algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…They can be categorised into three classes: biologically-based inspiration, e.g. genetic algorithm or GA [2], memetics algorithm or MAs [2], shuffled frog leaping algorithm or SFLA [2], firefly algorithm or FFA [3], bees algorithm or BEES [4], harmony search algorithm or HSA [5], neural network or NN [6], ant colony optimisation or ACO [7], evolutionary programming or EP [8], differential evolution or DE [9] and particle swarm optimisation or PSO [10]. Moreover, there are some with the socially-based inspiration, e.g.…”
Section: Introductionmentioning
confidence: 99%