2015
DOI: 10.1016/j.amc.2015.04.065
|View full text |Cite
|
Sign up to set email alerts
|

A variable step size firefly algorithm for numerical optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
64
0
2

Year Published

2016
2016
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 114 publications
(66 citation statements)
references
References 10 publications
0
64
0
2
Order By: Relevance
“…FA has been applied for solving different optimization problems such as OOTGU problem and benchmark optimization functions, and its results have been better than those from other popular methods like PSO, GA, and DE. But the method has not met the demand of dealing with large-scale systems and complicated constraints of OOTGU problem, and many studies have worked on improving it [49][50][51]53]. In fact, FA still suffers from several drawbacks such as premature convergence to local optimum or convergence to near global optimum with high number of iterations [54].…”
Section: Firefly Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…FA has been applied for solving different optimization problems such as OOTGU problem and benchmark optimization functions, and its results have been better than those from other popular methods like PSO, GA, and DE. But the method has not met the demand of dealing with large-scale systems and complicated constraints of OOTGU problem, and many studies have worked on improving it [49][50][51]53]. In fact, FA still suffers from several drawbacks such as premature convergence to local optimum or convergence to near global optimum with high number of iterations [54].…”
Section: Firefly Algorithmsmentioning
confidence: 99%
“…The memetic firefly algorithm (MFA) in [49] has focused on the balance of exploration acting as global search and exploitation acting as local search by using adaptive attractiveness β and adaptive step parameter α with respect to the change of iteration in formula updating new solutions for each lower quality solution. Another improved FA with using adaptive step parameter α (ASPFA) was proposed in [50] by suggesting an adaptive formula for updating step parameter α based on current iteration and the maximum number of iterations. The chaotic firefly algorithm (CFA) was developed in [51] for solving the considered OOTGU problem with different test cases of fuel cost function and constraints.…”
Section: Introductionmentioning
confidence: 99%
“…The objective of the nonlinear ELD optimization problem is to minimize cost while satisfying the load demand and other operational system equality and inequality constraints (Zhu et al, 2015).…”
Section: Problem Formulationmentioning
confidence: 99%
“…In addition, prohibited operating zone, ramp rate limits and multi-fuel options are usually considered. Since the objective is for the solution to converge to superior results in a reduced amount of time putting into consideration system constraints, choosing the appropriate optimization approach is important (Zhu et al, 2015).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation