원문정보
초록
영어
Firefly algorithm (FA) is a novel population-based stochastic optimization algorithm and has been shown to yield good performance for solving varieties of optimization problems. Meanwhile, it sustains premature convergence because it is easily to fall into the local optima which may generate a low accuracy of solution or even fail. To overcome this defect, a nonlinear time-varying step strategy for firefly algorithm (NTSFA) is presented. It uses a nonlinear decreasing and time-varying step-size for fireflies to better balance the algorithm’s ability of exploration and exploitation. Numerical simulation on 20 test benchmark functions display that the proposed algorithm can increase the accuracy of the original FA. Finally, we apply NTSFA to integrate into k-means clustering for mouse dataset. The results show that NTSFA is an effective optimization algorithm.
목차
1. Introduction
2. A Brief Overview of the Firefly Algorithm
2.1. The Biological Foundations of Firefly Algorithm
2.2. The Description and Analysis of Firefly Algorithm
2.3. Algorithm Complexity
3. The Nonlinear Time-Varying Step Strategy for Firefly Algorithm
3.1. Motivation
3.2. Nonlinear Time-Varying Step Settings
3.3. Program Flow of the Proposed Algorithm
4. Experimental Results and Discussion
4.1. Benchmark Functions and Experiment Settings
4.2. Result Comparisons on Solution Accuracy
4.3. Non-Parametric Test for Analyzing the Algorithms
4.4. NTSFA Performance on a Real-World Problem
5. Conclusion
Acknowledgements
References