JavaScript is disabled for your browser. Some features of this site may not work without it.
- ResearchSpace
- →
- Research Publications/Outputs
- →
- Conference Publications
- →
- View Item
| dc.contributor.author |
Grobler, J
|
|
| dc.contributor.author |
Engelbrecht, AP
|
|
| dc.contributor.author |
Kendall, G
|
|
| dc.contributor.author |
Yadavalli, VSS
|
|
| dc.date.accessioned | 2015-02-09T07:26:10Z | |
| dc.date.available | 2015-02-09T07:26:10Z | |
| dc.date.issued | 2014-12 | |
| dc.identifier.citation | Grobler, J, Engelbrecht, A.P, Kendall, G and Yadavalli, V.S.S. 2014. The entity-to-algorithm allocation problem: Extending the analysis. In: IEEE Symposium Series on Computational Intelligence, Orlando USA, 9-12 December 2014 | en_US |
| dc.identifier.uri | http://www.graham-kendall.com/papers/geky2014a.pdf | |
| dc.identifier.uri | http://hdl.handle.net/10204/7856 | |
| dc.description | IEEE Symposium Series on Computational Intelligence, Orlando USA, 9-12 December 2014 | en_US |
| dc.description.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 self-adaptive 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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_US |
| dc.relation.ispartofseries | Workflow;14000 | |
| dc.subject | Memetic algorithms | en_US |
| dc.subject | Hyper-heuristics | en_US |
| dc.subject | Metahyper-heuristic algorithms | en_US |
| dc.title | The entity-to-algorithm allocation problem: Extending the analysis | en_US |
| dc.type | Conference Presentation | en_US |
| dc.identifier.apacitation | Grobler, J., Engelbrecht, A., Kendall, G., & Yadavalli, V. (2014). The entity-to-algorithm allocation problem: Extending the analysis. IEEE. http://hdl.handle.net/10204/7856 | en_ZA |
| dc.identifier.chicagocitation | Grobler, J, AP Engelbrecht, G Kendall, and VSS Yadavalli. "The entity-to-algorithm allocation problem: Extending the analysis." (2014): http://hdl.handle.net/10204/7856 | en_ZA |
| dc.identifier.vancouvercitation | Grobler J, Engelbrecht A, Kendall G, Yadavalli V, The entity-to-algorithm allocation problem: Extending the analysis; IEEE; 2014. http://hdl.handle.net/10204/7856 . | en_ZA |
| dc.identifier.ris | TY - Conference Presentation AU - Grobler, J AU - Engelbrecht, AP AU - Kendall, G AU - Yadavalli, VSS AB - 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 self-adaptive 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. DA - 2014-12 DB - ResearchSpace DP - CSIR KW - Memetic algorithms KW - Hyper-heuristics KW - Metahyper-heuristic algorithms LK - https://researchspace.csir.co.za PY - 2014 T1 - The entity-to-algorithm allocation problem: Extending the analysis TI - The entity-to-algorithm allocation problem: Extending the analysis UR - http://hdl.handle.net/10204/7856 ER - | en_ZA |
