Back to Search
Start Over
Population Evolvability: Dynamic Fitness Landscape Analysis for Population-Based Metaheuristic Algorithms.
- Source :
- IEEE Transactions on Evolutionary Computation; Aug2018, Vol. 22 Issue 4, p550-563, 14p
- Publication Year :
- 2018
-
Abstract
- Fitness landscape analysis (FLA) is an important approach for studying how hard problems are for metaheuristic algorithms to solve. Static FLA focuses on extracting the properties of a problem and does not consider any information about the optimization algorithms; thus, it is not adequate for indicating whether a particular algorithm is suitable for solving a problem. By contrast, dynamic FLA considers the behavior of algorithms in combination with the properties of an optimization problem to determine the effectiveness of a given algorithm for solving that problem. However, previous dynamic FLA approaches are all individually based and lack statistical significance. In this paper, the concept of population evolvability is presented, as an extension of dynamic FLA, to quantify the effectiveness of population-based metaheuristic algorithms for solving a given problem. Specifically, two measures of population evolvability are defined that describe the probability that a population will obtain improved solutions to a problem and its ability to do so. Then, a combined measure is derived from these two measures to represent the overall population evolvability. Subsequently, the significance and validity of the proposed measures are investigated through analytical and experimental studies. Finally, the utility of the proposed measures is illustrated in an application of algorithm selection for black-box optimization problems. High accuracy in selecting the best algorithm is observed in a statistical analysis, with a low computational cost in terms of fitness evaluations. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 1089778X
- Volume :
- 22
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Evolutionary Computation
- Publication Type :
- Academic Journal
- Accession number :
- 130980921
- Full Text :
- https://doi.org/10.1109/TEVC.2017.2744324