A Framework for Self-Tuning Optimization Algorithm
Not on the map. Why?
Abstract (arXiv)
The performance of any algorithm will largely depend on the setting of its algorithm-dependent parameters. The optimal setting should allow the algorithm to achieve the best performance for solving a range of optimization problems. However, such parameter-tuning itself is a tough optimization problem. In this paper, we present a framework for self-tuning algorithms so that an algorithm to be tuned can be used to tune the algorithm itself. Using the firefly algorithm as an example, we show that this framework works well. It is also found that different parameters may have different sensitivities, and thus require different degrees of tuning. Parameters with high sensitivities require fine-tuning to achieve optimality.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Dec 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.
- 2024Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo Methodscited by 1
- 2025Parameter Tuning of the Firefly Algorithm by Three Tuning Methods: Standard Monte Carlo, Quasi-Monte Carlo and Latin Hypercube Sampling Methodscited by 1
- 2026When Fireflies Cluster; Enhancing Automatic Clustering via Centroid-Guided Firefly Optimizationcited by 0
- 2026When Fireflies Cluster; Enhancing Automatic Clustering via Centroid-Guided Firefly Optimization18 May 2026
- 2025Parameter Tuning of the Firefly Algorithm by Three Tuning Methods: Standard Monte Carlo, Quasi-Monte Carlo and Latin Hypercube Sampling Methods10 Apr 2025
- 2024Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo Methods1 Jul 2024