Skip to main content
SpringerLink
Log in

Oversized Populations and Cooperative Selection: Dealing with Massive Resources in Parallel Infrastructures

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2013)

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

Included in the following conference series:

Abstract

This paper proposes a new selection scheme for Evolutionary Algorithms (EAs) based on altruistic cooperation between individuals. Cooperation takes place every time an individual undergoes selection: the individual decreases its own fitness in order to improve the mating chances of worse individuals. On the one hand, the selection scheme guarantees that the genetic material of fitter individuals passes to subsequent generations as to decrease their fitnesses individuals have to be firstly selected. On the other hand, the scheme restricts the number of times an individual can be selected not to take over the entire population. We conduct an empirical study for a parallel EA version where cooperative selection scheme is shown to outperform binary tournament: both selection schemes yield the same qualities of solutions but cooperative selection always improves the times to solutions.

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 EPUB and 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

Notes

  1. 1.

    We follow here the selectorecombinative approach of Lobo and Lima [7] for studying the scalability of the population size.

References

  1. Alba, E., Dorronsoro, B.: The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Trans. Evol. Comput. 9(2), 126–142 (2005)

    Article  Google Scholar 

  2. Eiben, A.E., Schut, M.C., De Wilde, A.R.: Boosting genetic algorithms with self-adaptive selection. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1584–1589 (2006)

    Google Scholar 

  3. Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)

    Book  MATH  Google Scholar 

  4. Lombraña González, D., Jiménez Laredo, J., Fernández de Vega, F., Merelo Guervós, J.: Characterizing fault-tolerance of genetic algorithms in desktop grid systems. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 131–142. Springer, Heidelberg (2010)

    Google Scholar 

  5. Laredo, J.L.J., Eiben, A.E., van Steen, M., Merelo Guervós, J.J.: Evag: a scalable peer-to-peer evolutionary algorithm. Genet. Program. Evolvable Mach. 11(2), 227–246 (2010)

    Article  Google Scholar 

  6. Lässig, J., Sudholt, D.: General scheme for analyzing running times of parallel evolutionary algorithms. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 234–243. Springer, Heidelberg (2010)

    Google Scholar 

  7. Lobo, F., Lima, C.: Adaptive population sizing schemes in genetic algorithms. In: Lobo, F., Lima, C., Zbigniew, M. (eds.) Parameter Setting in Evolutionary Algorithms, vol. 54, pp. 185–204. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Lobo, F.G., Goldberg, D.E.: The parameter-less genetic algorithm in practice. Inf. Sci. Inf. Comput. Sci. 167(1–4), 217–232 (2004)

    MATH  Google Scholar 

  9. Potter, M.A., De Jong, K.A.: A cooperative coevolutionary approach to function optimization. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN LNCS, vol. 866, pp. 249–267. Springer, Heidelberg (1994)

    Google Scholar 

  10. David Schaffer, J., Eshelman, L.J.: On crossover as an evolutionarily viable strategy. In: Belew, R.K., Booker, L.B. (eds.) ICGA, pp. 61–68. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

Download references

Acknowledgments

This work was supported by the Luxembourg FNR Green@Cloud project (INTER/CNRS/11/03) and by the Spanish Ministry of Science Project (TIN2011-28627-C04). B. Dorronsoro acknowledges the support by the Fonds National de la Recherche, Luxembourg (AFR contract no 4017742).

Author information

Authors and Affiliations

  1. FSTC-CSC/SnT, University of Luxembourg, Walferdange, Luxembourg

    Juan Luis Jiménez Laredo & Pascal Bouvry

  2. Laseeb, Technical University of Lisbon, Lisbon, Portugal

    Carlos Fernandes

  3. Laboratoire d’Informatique Fondamentale de Lille, University of Lille, Lille, France

    Bernabe Dorronsoro

  4. Geneura Lab, University of Granada, Granada, Spain

    Carlos Fernandes & Juan Julian Merelo

Authors
  1. Juan Luis Jiménez Laredo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernabe Dorronsoro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carlos Fernandes
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Juan Julian Merelo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Pascal Bouvry
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juan Luis Jiménez Laredo .

Editor information

Editors and Affiliations

  1. Università Catania Dipto. Matematica e Informatica, Catania, Italy

    Giuseppe Nicosia

  2. Industrial & Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiménez Laredo, J., Dorronsoro, B., Fernandes, C., Merelo, J., Bouvry, P. (2013). Oversized Populations and Cooperative Selection: Dealing with Massive Resources in Parallel Infrastructures. In: Nicosia, G., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2013. Lecture Notes in Computer Science(), vol 7997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44973-4_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-44973-4_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-44972-7

  • Online ISBN: 978-3-642-44973-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation