Advertisement

Automatic Adaption of Operator Probabilities in Genetic Algorithms with Offspring Selection

  • Stefan Wagner
  • Michael Affenzeller
  • Andreas Scheibenpflug
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9520)

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.

Notes

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).

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Reinelt, G.: TSPLIB - a traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)CrossRefzbMATHGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Stefan Wagner
    • 1
  • Michael Affenzeller
    • 1
    • 2
  • Andreas Scheibenpflug
    • 1
    • 2
  1. 1.Heuristic and Evolutionary Algorithms Laboratory, School of Informatics, Communications and Media – Campus HagenbergUniversity of Applied Sciences Upper AustriaHagenbergAustria
  2. 2.Institute for Formal Models and VerificationJohannes Kepler University LinzLinzAustria

Personalised recommendations