Skip to main content

Evolutionary Operator Self-adaptation with Diverse Operators

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7244))

Abstract

Operator adaptation in evolutionary computation has previously been applied to either small numbers of operators, or larger numbers of fairly similar ones. This paper focuses on adaptation in algorithms offering a diverse range of operators. We compare a number of previously-developed adaptation strategies, together with two that have been specifically designed for this situation. Probability Matching and Adaptive Pursuit methods performed reasonably well in this scenario, but a strategy combining aspects of both performed better. Multi-Arm Bandit techniques performed well when parameter settings were suitably tailored to the problem, but this tailoring was difficult, and performance was very brittle when the parameter settings were varied.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2), 235–256 (2002)

    Article  MATH  Google Scholar 

  2. DaCosta, L., Fialho, Á., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic Multi-Armed bandits. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 913–920. ACM, New York (2008)

    Chapter  Google Scholar 

  3. Fialho, Á., Da Costa, L., Schoenauer, M., Sebag, M.: Dynamic Multi-Armed Bandits and Extreme Value-Based Rewards for Adaptive Operator Selection in Evolutionary Algorithms. In: Stützle, T. (ed.) LION 3. LNCS, vol. 5851, pp. 176–190. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Fialho, Á., Schoenauer, M., Sebag, M.: Analysis of adaptive operator selection techniques on the royal road and long k-path problems. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 779–786. ACM, New York (2009)

    Chapter  Google Scholar 

  5. Goldberg, D.: Probability matching, the magnitude of reinforcement, and classifier system bidding. Machine Learning 5(4), 407–425 (1990)

    Google Scholar 

  6. Hoai, N.: A Flexible Representation for Genetic Programming: Lessons from Natural Language Processing. Ph.D. thesis, University of New South Wales, Australian Defence Force Academy (2004)

    Google Scholar 

  7. Igel, C., Kreutz, M.: Operator adaptation in evolutionary computation and its application to structure optimization of neural networks. Neurocomputing 55, 347–361 (2003)

    Article  Google Scholar 

  8. Kim, D., McKay, R.I., Haisoo, S., Yun-Geun, L., Xuan, N.X.: Ecological application of evolutionary computation: Improving water quality forecasts for the nakdong river, korea. In: World Congress on Computational Intelligence, pp. 2005–2012. IEEE Press (2010)

    Google Scholar 

  9. Kim, M.H., McKay, R.I(B.), Nguyen, X.H., Kim, K.: Operator Self-adaptation in Genetic Programming. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds.) EuroGP 2011. LNCS, vol. 6621, pp. 215–226. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)

    Google Scholar 

  11. Koza, J.R.: Genetic Programming II Automatic Discovery of Reusable Programs. MIT Press (1994)

    Google Scholar 

  12. Lobo, F., Lima, C., Michalewicz, Z. (eds.): Parameter setting in evolutionary algorithms. SCI, vol. 54. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  13. Page, E.: Continuous inspection schemes. Biometrika 41(1), 100–115 (1954)

    MathSciNet  MATH  Google Scholar 

  14. Schwefel, H.: Numerical optimization of computer models. John Wiley & Sons, Inc., New York (1981)

    MATH  Google Scholar 

  15. Thathachar, M., Sastry, P.: A class of rapidly converging algorithms for learning automata. IEEE Transactions on Systems, Man and Cybernetics 15, 168–175 (1985)

    MathSciNet  MATH  Google Scholar 

  16. Thierens, D.: Adaptive Strategies for Operator Allocation. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary Algorithms. SCI, vol. 54, pp. 77–90. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation, pp. 1539–1546. ACM, New York (2005)

    Google Scholar 

  18. Tuson, A., Ross, P.: Adapting operator settings in genetic algorithms. Evolutionary Computation 6(2), 161–184 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, M., McKay, R.I.(., Kim, DK., Nguyen, X.H. (2012). Evolutionary Operator Self-adaptation with Diverse Operators. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds) Genetic Programming. EuroGP 2012. Lecture Notes in Computer Science, vol 7244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29139-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29139-5_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29138-8

  • Online ISBN: 978-3-642-29139-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics