Abstract
When offspring selection is applied in genetic algorithms, multiple crossover and mutation operators can be easily used together as crossover and mutation results of insufficient quality are discarded in the additional selection step after creating new solutions. Therefore, the a priori choice of appropriate crossover and mutation operators becomes less critical and it even turned out that multiple operators reduce the bias, broaden the search, and thus lead to higher solution quality in the end. However, using crossover and mutation operators which often produce solutions not passing the offspring selection criterion also increases the selection pressure and consequently the number of evaluated solutions.
Therefore, we present a new generic scheme for tuning the selection probabilities of multiple crossover and mutation operators in genetic algorithms with offspring selection automatically at runtime. Thereby those operators are applied more frequently which were able to produce good results in the last generation, which leads to comparable solution quality and results in a significant decrease of evaluated solutions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
All code and data required to reproduce these tests are published on http://dev.heuristiclab.com/AdditionalMaterial.
References
Affenzeller, M., Wagner, S.: SASEGASA: a new generic parallel evolutionary algorithm for achieving highest quality results. J. Heuristics - Spec. Issue New Adv. Parallel Meta-Heuristics Complex Probl. 10, 239–263 (2004)
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. Springer Computer Series, pp. 218–221. Springer, Vienna (2005)
Affenzeller, M., Wagner, S., Winkler, S.: Effective allele preservation by offspring selection: an empirical study for the TSP. Int. J. Simul. Process Model. 6(1), 29–39 (2010)
Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, D.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif. Intell. Rev. 13, 129–170 (1999)
Pandey, H.M., Choudhary, A., Mehrotra, D.: A comparative review of approaches to prevent premature convergence in ga. Appl. Soft Comput. 24, 1047–1077 (2014)
Reinelt, G.: TSPLIB - a traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)
Wagner, S., Kronberger, G., Beham, A., Kommenda, M., Scheibenpflug, A., Pitzer, E., Vonolfen, S., Kofler, M., Winkler, S.: Architecture and design of the heuristiclab optimization environment. In: Klempous, R., Nikodem, J., Jacak, W., Chaczko, Z. (eds.) Advanced Methods and Applications in Computational Intelligence. Topics in Intelligent Engineering and Informatics, vol. 6, pp. 197–261. Springer, New York (2014)
Acknowledgements
The work described in this paper was done within the COMET Project Heuristic Optimization in Production and Logistics (HOPL), #843532 funded by the Austrian Research Promotion Agency (FFG).
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
Wagner, S., Affenzeller, M., Scheibenpflug, A. (2015). Automatic Adaption of Operator Probabilities in Genetic Algorithms with Offspring Selection. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science(), vol 9520. Springer, Cham. https://doi.org/10.1007/978-3-319-27340-2_54
Download citation
DOI: https://doi.org/10.1007/978-3-319-27340-2_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27339-6
Online ISBN: 978-3-319-27340-2
eBook Packages: Computer ScienceComputer Science (R0)