DocumentCode :
232484
Title :
The entity-to-algorithm allocation problem: extending the analysis
Author :
Grobler, Jacomine ; Engelbrecht, Andries ; Kendall, Graham ; Yadavalli, V.S.S.
Author_Institution :
Dept. of Ind. & Syst. Eng., Univ. of Pretoria, Pretoria, South Africa
fYear :
2014
fDate :
9-12 Dec. 2014
Firstpage :
1
Lastpage :
8
Abstract :
This paper extends the investigation into the algorithm selection problem in hyper-heuristics, otherwise referred to as the entity-to-algorithm allocation problem, introduced by Grobler et al.. Two newly developed population-based portfolio algorithms (the evolutionary algorithm based on selfadaptive learning population search techniques (EEA-SLPS) and the Multi-EA algorithm) are compared to two metahyper- heuristic algorithms. The algorithms are evaluated under similar conditions and the same set of constituent algorithms on a diverse set of floating-point benchmark problems. One of the meta-hyper-heuristics are shown to outperform the other algorithms, with EEA-SLPS coming in a close second.
Keywords :
evolutionary computation; search problems; EEA-SLPS; algorithm selection problem; entity-to-algorithm allocation problem; evolutionary algorithm based on self-adaptive learning population search techniques; floating-point benchmark problems; meta-hyper-heuristics; multiEA algorithm; population-based portfolio algorithms; Algorithm design and analysis; Heuristic algorithms; Optimization; Portfolios; Resource management; Sociology; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence in Ensemble Learning (CIEL), 2014 IEEE Symposium on
Conference_Location :
Orlando, FL
Type :
conf
DOI :
10.1109/CIEL.2014.7015744
Filename :
7015744
Link To Document :
بازگشت