A Framework for Self-Tuning Optimization Algorithm

Abstract

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.

12 pages

References in corpus (2)

• A comprehensive review of firefly algorithms
• Levy Flights, Non-local Search and Simulated Annealing

Cited by in corpus (14)

• Nature-Inspired Optimization Algorithms: Challenges and Open Problems
• Swarm Intelligence Based Algorithms: A Critical Analysis
• Influence of Initialization on the Performance of Metaheuristic Optimizers
• Swarm Intelligence: Past, Present and Future
• Random-Key Cuckoo Search for the Travelling Salesman Problem
• Why the Firefly Algorithm Works?
• Global Convergence Analysis of the Flower Pollination Algorithm: A Discrete-Time Markov Chain Approach
• Parameter Tuning of the Firefly Algorithm by Three Tuning Methods: Standard Monte Carlo, Quasi-Monte Carlo and Latin Hypercube Sampling Methods
• Review of Parameter Tuning Methods for Nature-Inspired Algorithms
• A Generalized Evolutionary Metaheuristic (GEM) Algorithm for Engineering Optimization
• Social Algorithms
• Self-Tuning Stochastic Optimization with Curvature-Aware Gradient Filtering
• Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo Methods
• Bio-Inspired Computation: Success and Challenges of IJBIC