Skip to main content

Integrating Techniques from Statistical Ranking into Evolutionary Algorithms

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2006)

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

Included in the following conference series:

Abstract

Many practical optimization problems are subject to uncertain fitness evaluations. One way to reduce the noise is to average over multiple samples of the fitness function in order to evaluate a single individual. This paper proposes a general way to integrate statistical ranking and selection procedures into evolutionary algorithms. The proposed procedure focuses sampling on those individuals that are crucial for the evolutionary algorithm, and distributes samples in a way that efficiently reduces uncertainty. The goal is to drastically reduce the number of evaluations required for a proper operation of the evolutionary algorithm in noisy environments.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, D.V., Beyer, H.-G.: A comparison of evolution strategies with other direct search methods in the presence of noise. Computational Optimization and Applications 24, 135–159 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bartz-Beielstein, T., Blum, D., Branke, J.: Particle swarm optimization and sequential sampling in noisy environments. In: Metaheuristics International Conference (2005)

    Google Scholar 

  3. Beyer, H.-G.: Toward a theory of evolution strategies: Some asymptotical results from the (1 +, λ)-theory. Evolutionary Computation 1(2), 165–188 (1993)

    Article  Google Scholar 

  4. Boesel, J.: Search and Selection for Large-Scale Stochastic Optimization. PhD thesis, Northwestern University, Evanston, Illinois, USA (1999)

    Google Scholar 

  5. Boesel, J., Nelson, B.L., Kim, S.H.: Usint ranking and selection to ”clean up” after simulation optimization. Operations Research 51, 814–825 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer, Dordrecht (2001)

    Google Scholar 

  7. Branke, J., Chick, S., Schmidt, C.: New developments in ranking and selection: An empirical comparison of the three main approaches. In: Kuhl, N.E., Steiger, M.N., Armstrong, F.B., Joines, J.A. (eds.) Winter Simulation Conference, pp. 708–717. IEEE, Los Alamitos (2005)

    Chapter  Google Scholar 

  8. Branke, J., Schmidt, C.: Selection in the presence of noise. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 766–777. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Branke, J., Schmidt, C.: Sequential sampling in noisy environments. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 202–211. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Buchholz, P., Thümmler, A.: Enhancing evolutionary algorithms with statistical sselection procedures for simulation optimization (2005)

    Google Scholar 

  11. Cantu-Paz, E.: Adaptive sampling for noisy problems. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 947–958. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Chen, C.-H.: A lower bound for the correct subset-selection probability and its application to discrete event simulations. IEEE Transactions on Automatic Control 41(8), 1227–1231 (1996)

    Article  MATH  Google Scholar 

  13. Di Pietro, A., While, L., Barone, L.: Applying evolutionary algorithms to problems with noisy, time-consuming fitness functions. In: Congress on Evolutionary Computation, pp. 1254–1261. IEEE, Los Alamitos (2004)

    Google Scholar 

  14. Hammel, U., Bäck, T.: Evolution strategies on noisy functions, how to improveconvergence properties. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866. Springer, Heidelberg (1994)

    Google Scholar 

  15. Hedlund, H.E., Mollaghasemi, M.: A genetic algorithm and an indifference-zone ranking and selection framework for simulation optimization. In: Winter Simulation Conference, pp. 417–421. IEEE, Los Alamitos (2001)

    Google Scholar 

  16. Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments – asurvey. IEEE Transactions on Evolutionary Computation 9(3), 303–317 (2005)

    Article  Google Scholar 

  17. Stagge, P.: Averaging efficiently in the presence of noise. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 188–197. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmidt, C., Branke, J., Chick, S.E. (2006). Integrating Techniques from Statistical Ranking into Evolutionary Algorithms. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2006. Lecture Notes in Computer Science, vol 3907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11732242_73

Download citation

  • DOI: https://doi.org/10.1007/11732242_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33237-4

  • Online ISBN: 978-3-540-33238-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics