Offspring Selection Genetic Algorithm Revisited: Improvements in Efficiency by Early Stopping Criteria in the Evaluation of Unsuccessful Individuals
This paper proposes some algorithmic extensions to the general concept of offspring selection which itself is an algorithmic extension of genetic algorithms and genetic programming. Offspring selection is characterized by the fact that many offspring solution candidates will not participate in the ongoing evolutionary process if they do not achieve the success criterion. The algorithmic enhancements proposed in this contribution aim to early estimate if a solution candidate will not be accepted based on partial solution evaluation. The qualitative characteristics of offspring selection are not affected by this means. The discussed variant of offspring selection is analyzed for several symbolic regression problems with offspring selection genetic programming. The achievable gains in terms of efficiency are remarkable especially for large data-sets.
The work described in this paper was done within the COMET Project #843532 Heuristic Optimization in Production and Logistics (HOPL) funded by the Austrian Research Promotion Agency (FFG) and the Government of Upper Austria and the COMET Project #843551 Advanced Engineering Design Automation (AEDA) funded by the Austrian Research Promotion Agency (FFG) and the Government of Vorarlberg.
- 1.Affenzeller, M., Wagner, S.: Offspring selection: a new self-adaptive selection scheme for genetic algorithms. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds.) Adaptive and Natural Computing Algorithms, pp. 218–221. Springer, Vienna (2005). https://doi.org/10.1007/3-211-27389-1_52 CrossRefGoogle Scholar
- 2.Holland, J.H.: Adaption in Natural and Artifical Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
- 5.Affenzeller, M., Wagner, S.: SASEGASA: an evolutionary algorithm for retarding premature convergence by self-adaptive selection pressure steering. In: Mira, J., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2686, pp. 438–445. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-44868-3_56 CrossRefGoogle Scholar
- 6.Affenzeller, M., Winkler, S.M., Kronberger, G., Kommenda, M., Burlacu, B., Wagner, S.: Gaining deeper insights in symbolic regression. In: Riolo, R., Moore, J.H., Kotanchek, M. (eds.) Genetic Programming Theory and Practice XI. GEC, pp. 175–190. Springer, New York (2014). https://doi.org/10.1007/978-1-4939-0375-7_10 CrossRefGoogle Scholar
- 7.Affenzeller, M., Beham, A., Vonolfen, S., Pitzer, E., Winkler, S.M., Hutterer, S., Kommenda, M., Kofler, M., Kronberger, G., Wagner, S.: Simulation-based optimization with HeuristicLab: practical guidelines and real-world applications. In: Mujica Mota, M., De La Mota, I.F., Guimarans Serrano, D. (eds.) Applied Simulation and Optimization, pp. 3–38. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-15033-8_1 Google Scholar