A Literature Survey on Offline Automatic Algorithm Configuration
Open Access
- 21 June 2022
- journal article
- review article
- Published by MDPI AG in Applied Sciences
- Vol. 12 (13) , 6316
Abstract
Metaheuristic and heuristic methods have many tunable parameters, and choosing their values can increase their ability to deal with hard optimization problems. Automated approaches for finding good parameter settings have attracted significant research and development efforts in the last few years. Because parameter tuning became commonly utilized in industry and research and there is a significant advancement in this area, a comprehensive review is an important requirement. Although there is very wide literature about algorithm configuration problems, a detailed survey analysis has not been conducted yet to the best of our knowledge. In this paper, we will briefly explain the automatic algorithm configuration problem and then survey the automated methods developed to handle this problem. After explaining the logic of these methods, we also argued about their main advantages and disadvantages to help researchers or practitioners select the best possible method for their specific problem. Moreover, some recommendations and possible future directions for this topic are provided as a conclusion.Keywords
This publication has 97 references indexed in Scilit:
- Using fuzzy logic to tune an evolutionary algorithm for dynamic optimization of chemical processesComputers & Chemical Engineering, 2012
- Parameter tuning for configuring and analyzing evolutionary algorithmsSwarm and Evolutionary Computation, 2011
- Finding Optimal Algorithmic Parameters Using Derivative‐Free OptimizationSIAM Journal on Optimization, 2006
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Completely Derandomized Self-Adaptation in Evolution StrategiesEvolutionary Computation, 2001
- A systematic procedure for setting parameters in simulated annealing algorithmsComputers & Operations Research, 1998
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Design and Analysis of Computer ExperimentsStatistical Science, 1989
- ADAPTIVE SEARCH USING A REPRODUCTIVE META‐PLANKybernetes, 1978
- Sequential minimax search for a maximumProceedings of the American Mathematical Society, 1953