Self-adaptive step firefly algorithm
Summary: In the standard firefly algorithm, each firefly has the same step settings and its values decrease from iteration to iteration. Therefore, it may fall into the local optimum. Furthermore, the decreasing of step is restrained by the maximum of iteration, which has an influence on the convergence speed and precision. In order to avoid falling into the local optimum and reduce the impact of the maximum of iteration, a self-adaptive step firefly algorithm is proposed in the paper. Its core idea is setting the step of each firefly varying with the iteration, according to each firefly's historical information and current situation. Experiments are made to show the performance of our approach compared with the standard FA, based on sixteen standard testing benchmark functions. The results reveal that our method can prevent the premature convergence and improve the convergence speed and accurateness.
- A variable step size firefly algorithm for numerical optimization
- Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization
- Enhancing firefly algorithm with courtship learning
- A dynamic adaptive firefly algorithm with globally orientation
- Enhancing firefly algorithm using generalized opposition-based learning
- Comparative performance analysis of 2DOF state feedback controller for automatic generation control using whale optimization algorithm
- scientific article; zbMATH DE number 6874148 (Why is no real title available?)
- Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
- A novel wise step strategy for firefly algorithm
- scientific article; zbMATH DE number 6746795 (Why is no real title available?)
This page was built for publication: Self-adaptive step firefly algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791339)
