Skip to main content
SpringerLink
Log in

Order Statistics in Artificial Evolution

  • Conference paper
Artificial Evolution (EA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2936))

  • 658 Accesses

Abstract

This article deals with the exploitation of statistical information from extremes values of an evolutionary algorithm.

One can use the fact that upper order statistics of a sample converge to known distributions for improving efficiency of selection and crossover operators.

The work presented in this paper is restricted to criteria defined on real vector spaces. It relies on an underlying canonical model of genetic algorithm, namely tournament selection and uniform crossover. Nevertheless, the results obtained so far encourage further investigations.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Blickle, T.: Tournament selection. In: Handbook of Evolutionary Computation, IOP Publishing Ltd. (1997)

    Google Scholar 

  2. de Haan, L.: Estimation of the minimum of a function using order statistics. Journal of the American Statistical Association (1981)

    Google Scholar 

  3. Kallel, L., Del Moral, P., Rowe, J.: Modeling genetic algorithms with interacting particle systems. Revista de Matematica, Teoria y aplicaciones (2001)

    Google Scholar 

  4. Gonzalo, J., Olmo, J.: Which extreme values are really extremes (2003) (preprint)

    Google Scholar 

  5. Hill, B.M.: A simple approach to inference about the tail of a distribution. Annals of Statistics (1975)

    Google Scholar 

  6. Pickhands, J.: Statistical inference using extreme order statistics. Annals of Statistics (1975)

    Google Scholar 

  7. Reiss, R.D.: Approximate distributions of order statistics. Springer, Heidelberg (1989)

    MATH  Google Scholar 

  8. Zhighljavsky, A.A.: Theory of random search. Kluwer Academic Publishers, Dordrecht (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ENAC, 7, Avenue Edouard Belin, 31055, Toulouse Cedex

    Stephane Puechmorel

  2. CENA,  

    Daniel Delahaye

Authors
  1. Stephane Puechmorel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Delahaye
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UMR-CNRS 6632, Université de Provence, 39 rue F. Joliot-Curie, 13453, Marseille cedex 13, France

    Pierre Liardet

  2. Université Louis Pasteur, LSIIT, FDBT, Pôle API, F-67400, Illkirch, France

    Pierre Collet

  3. Laboratoire d’Informatique du Littoral, Maison de la Recherche Blaise Pascal, 50 rue Ferdinand Buisson, BP 719, 62228, Calais Cedex, France

    Cyril Fonlupt

  4. INRIA Saclay - Ile-de-France, Parc Orsay Université, 4, rue Jacques Monod, 91893, Orsay Cedex, France

    Evelyne Lutton

  5. TAO, INRIA Saclay & LRI (UMR CNRS 8623), Bât 490, Université Paris-Sud, 91405, Orsay Cedex, France

    Marc Schoenauer

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Puechmorel, S., Delahaye, D. (2004). Order Statistics in Artificial Evolution. In: Liardet, P., Collet, P., Fonlupt, C., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2003. Lecture Notes in Computer Science, vol 2936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24621-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24621-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21523-3

  • Online ISBN: 978-3-540-24621-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation