Skip to main content
SpringerLink
Log in

DISPAR-Tournament: A Parallel Population Reduction Operator That Behaves Like a Tournament

  • Conference paper
Applications of Evolutionary Computation (EvoApplications 2011)

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

Included in the following conference series:

Abstract

This paper presents an experimental study of different variants of tournament selection, and proposes a new DISPAR-tournament (Disjoint Sets Parallel tournament) operator for population reduction to be used in parallel implementations of evolution strategies and other evolutionary algorithms.

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. Amdahl, G.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the Spring Joint Computer Conference, pp. 483–485. ACM, New York (1967)

    Google Scholar 

  2. Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. In: Evolutionary Computation, pp. 361–394 (1997)

    Google Scholar 

  3. Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of Genetic Algorithms, pp. 69–93. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  4. Hancock, P.J.B.: An empirical comparison of selection methods in evolutionary algorithms. In: Fogarty, T.C. (ed.) AISB-WS 1994. LNCS, vol. 865, pp. 80–94. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  5. Motoki, T.: Calculating the expected loss of diversity of selection schemes. Evol. Comput. 10(4), 397–422 (2002)

    Article  Google Scholar 

  6. Muhlenbein, H., Schlierkamp-Voosen, D.: Predictive models for the breeder genetic algorithm – i. continuous parameter optimization. Evolutionary Computation 1, 25–49 (1993)

    Article  Google Scholar 

  7. Rogers, A., Prugel-Bennett, A.: Genetic drift in genetic algorithm selection schemes. IEEE Transactions on Evolutionary Computation 3(4), 298–303 (1999)

    Article  Google Scholar 

  8. Sastry, K., Goldberg, D.E.: Modeling tournament selection with replacement using apparent added noise. Technical report, Intelligent Engineering Systems Through Artificial Neural Networks,11, 129–134 (2001) (also IlliGAL)

    Google Scholar 

  9. Schwefel, H.-P.: Numerical optimization of computer models, 2nd edn. John Wiley & Sons, Chichester (1995)

    Google Scholar 

  10. Sokolov, A., Whitley, D.: Unbiased tournament selection. In: GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 1131–1138. ACM, New York (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSIIT - UMR 7005 Pôle API, Bd Sébastien Brant, BP 10413, 67412, Illkirch, France

    Ogier Maitre, Deepak Sharma, Nicolas Lachiche & Pierre Collet

Authors
  1. Ogier Maitre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deepak Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolas Lachiche
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pierre Collet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, University of Strathclyde, 16 Richmond Street, G1 1XQ, Glasgow, UK

    Cecilia Di Chio

  2. Department of Computer Engineering, University of Parma, Viale Usberti 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  3. Departamento de Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Campus Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  4. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 1, 72076, Tübingen, Germany

    Marc Ebner

  5. Knowledge Engineering Research Group, Aston University, Aston Triangle, B4 7ET, Birmingham, UK

    Anikó Ekárt

  6. Instituto Tecnológico de Informática, Universidad Politécnica de Valencia, Edif. 8G Acceso B, 46022, Valencia, Spain

    Anna I. Esparcia-Alcázar

  7. Departamento de Electrónica y Tecnología de los Computadores, Universidad de Granada, 18071, Grenada, Spain

    Juan J. Merelo

  8. Department of Mathematical Information Technology, University of Jyväskylä, 4th Floor, P.O. Box 25, 40014, Agora, Finland

    Ferrante Neri

  9. Lehrstuhl für Algorithm Engineering, Technische Universität Dortmund, Otto-Hahn-Straße 14, 44227, Dortmund, Germany

    Mike Preuss

  10. Fakultät Elektrotechnik und Informationstechnik, HTWK Leipzig, Postfach 30 11 66, 04251, Leipzig, Germany

    Hendrik Richter

  11. Center for Computer Games Research, IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark

    Julian Togelius  & Georgios N. Yannakakis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maitre, O., Sharma, D., Lachiche, N., Collet, P. (2011). DISPAR-Tournament: A Parallel Population Reduction Operator That Behaves Like a Tournament. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2011. Lecture Notes in Computer Science, vol 6624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20525-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20525-5_29

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation