.png){kind=icon}
返回
Selecting evolutionary algorithms for black box design optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-3302-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An algorithm selection method for black box design optimization problems is reported. It uses a simple and natural principle to select an algorithm set from a set of algorithm candidates. A set of benchmark problems is given, and the performance of each algorithm in the set is recorded in a knowledge base. Given an unknown problem, the default algorithm is run. An algorithm-problem feature is proposed and used to map to the most similar benchmark problem. Then the best algorithm for solving the problem is used in the second run. This process iterates until n runs have been made. The best result out of n runs is returned as the solution. Experimental results reveal that the algorithm-problem feature is a good problem identifier. Results are also reported when (1) both the training and testing set are the set of benchmark problems; and (2) the training set is the set of benchmark problems but the testing set is a set of real-world benchmark problems. The method works well on both scenarios. It attains almost the same performance as the best algorithm, and has better performance compared with random selection. As the best algorithm cannot be known a priori, the results confirm that the algorithm selection mechanism is effective. The performance of the algorithm as a function of n and the case when n is equal to two is also studied.
Keyword:
Evolutionary algorithm
Algorithm selection
Benchmarking performance
Design optimization problems
Black box problems
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Exploratory Landscape Analysis of Continuous Space Optimization Problems Using Information Content
PREAI
分享收藏分享收藏Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization求解全局数值优化问题的策略自适应差分进化算法
OAAI
OAAI分享收藏
查看更多内容