Abstract
Hyper-Heuristics (HH) is a field of research that aims to automatically discover effective and robust algorithmic strategies by combining low-level components of existing methods and by defining the appropriate settings. Standard HH frameworks usually comprise two sequential stages: Learning is where promising strategies are discovered; and Validation is the subsequent phase that consists in the application of the best learned strategies to unseen optimization scenarios, thus assessing its generalization ability.
Evolutionary Algorithms are commonly employed by the HH learning step to evolve a set of candidate strategies. In this stage, the algorithm relies on simple fitness criteria to estimate the optimization ability of the evolved strategies. However, the adoption of such basic conditions might compromise the accuracy of the evaluation and it raises the question whether the HH framework is able to accurately identify the most promising strategies learned by the evolutionary algorithm. We present a detailed study to gain insight into the correlation between the optimization behavior exhibited in the learning phase and the corresponding performance in the validation step. In concrete, we investigate if the most promising strategies identified during learning keep the good performance when generalizing to unseen optimization scenarios. The analysis of the results reveals that simple fitness criteria are accurate predictors of the optimization ability of evolved strategies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Qu, R.: Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society 64(12), 1695–1724 (2013)
Dorigo, M., Stützle, T.: Ant Colony Optimization. Bradford Company, Scituate (2004)
Eiben, A., Smit, S.: Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm and Evolutionary Computation 1(1), 19–31 (2011)
López-Ibáñez, M., Stützle, T.: Automatic configuration of multi-objective ACO algorithms. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 95–106. Springer, Heidelberg (2010)
Lourenço, N., Pereira, F.B., Costa, E.: The importance of the learning conditions in hyper-heuristics. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013, pp. 1525–1532 (2013)
Lourenço, N., Pereira, F., Costa, E.: Learning selection strategies for evolutionary algorithms. In: Legrand, P., Corsini, M.-M., Hao, J.-K., Monmarché, N., Lutton, E., Schoenauer, M. (eds.) EA 2013. LNCS, vol. 8752, pp. 197–208. Springer, Heidelberg (2014)
Martin, M.A., Tauritz, D.R.: A problem configuration study of the robustness of a black-box search algorithm hyper-heuristic. In: Proceedings of the 2014 Conference Companion on Genetic and Evolutionary Computation Companion, GECCO Comp. 2014, pp. 1389–1396 (2014)
Merz, P., Freisleben, B.: Memetic algorithms for the traveling salesman problem. Complex Systems 13(4), 297–346 (2001)
O’Neill, M., Ryan, C.: Grammatical evolution: evolutionary automatic programming in an arbitrary language, vol. 4. Springer Science (2003)
Pappa, G.L., Freitas, A.: Automating the Design of Data Mining Algorithms: An Evolutionary Computation Approach, 1st edn. Springer Publishing Company, Incorporated (2009)
Runka, A.: Evolving an edge selection formula for ant colony optimization. In: Proceedings of the GECCO 2009, pp. 1075–1082 (2009)
de Sá, A.G.C., Pappa, G.L.: Towards a method for automatically evolving bayesian network classifiers. In: Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 1505–1512. ACM (2013)
Smit, S.K., Eiben, A.E.: Beating the world champion evolutionary algorithm via revac tuning. In: IEEE Congress on Evolutionary Computation (CEC) 2010, pp. 1–8. IEEE (2010)
Tavares, J., Pereira, F.B.: Automatic design of ant algorithms with grammatical evolution. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. LNCS, vol. 7244, pp. 206–217. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Lourenço, N., Pereira, F.B., Costa, E. (2015). The Optimization Ability of Evolved Strategies. In: Pereira, F., Machado, P., Costa, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 2015. Lecture Notes in Computer Science(), vol 9273. Springer, Cham. https://doi.org/10.1007/978-3-319-23485-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-23485-4_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23484-7
Online ISBN: 978-3-319-23485-4
eBook Packages: Computer ScienceComputer Science (R0)