Skip to main content
Springer Nature Link
Log in

A Library to Run Evolutionary Algorithms in the Cloud Using MapReduce

  • Conference paper
Applications of Evolutionary Computation (EvoApplications 2012)

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

Included in the following conference series:

  • 2441 Accesses

Abstract

We discuss ongoing development of an evolutionary algorithm library to run on the cloud. We relate how we have used the Hadoop open-source MapReduce distributed data processing framework to implement a single “island” with a potentially very large population. The design generalizes beyond the current, one-off kind of MapReduce implementations. It is in preparation for the library becoming a modeling or optimization service in a service oriented architecture or a development tool for designing new 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Web resource: ApacheHadoop, http://hadoop.apache.org/core

  2. Gunarathne, T., Wu, T.L., Qiu, J., Fox, G.: MapReduce in the clouds for science. In: 2010 IEEE Second International Conference on Cloud Computing Technology and Science, CloudCom (2010)

    Google Scholar 

  3. Web resource: MAHOUT, http://mahout.apache.org/

  4. Jin, C., Vecchiola, C., Buyya, R.: MRPGA: An extension of MapReduce for parallelizing genetic algorithms. In: IEEE Fourth International Conference on eScience 2008, pp. 214–221. IEEE (2008)

    Google Scholar 

  5. Verma, A., Llora, X., Campbell, R., Goldberg, D.: Scaling genetic algorithms using MapReduce. Technical report, Illigal TR 2009007

    Google Scholar 

  6. Verma, A., Llora, X., Venkataraman, S., Goldberg, D., Campbell, R.: Scaling ECGA model building via data-intensive computing. In: 2010 IEEE Congress on Evolutionary Computation, CEC (2010)

    Google Scholar 

  7. Verma, A., Llora, X., Goldberg, D., Campbell, R.: Scaling genetic algorithms using MapReduce. In: Ninth International Conference on Intelligent Systems Design and Applications, ISDA 2009 (2009)

    Google Scholar 

  8. Wang, S., Gao, B.J., Wang, K., Lauw, H.W.: Parallel learning to rank for information retrieval. In: Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information, SIGIR 2011, pp. 1083–1084. ACM, New York (2011)

    Chapter  Google Scholar 

  9. Huang, D.W., Lin, J.: Scaling populations of a genetic algorithm for job shop scheduling problems using MapReduce. In: 2010 IEEE Second International Conference on Cloud Computing Technology and Science, CloudCom (2010)

    Google Scholar 

  10. Verma, A., Zea, N., Cho, B., Gupta, I., Campbell, R.: Breaking the MapReduce stage barrier. In: 2010 IEEE International Conference on Cluster Computing (CLUSTER), pp. 235–244. IEEE (2010)

    Google Scholar 

  11. Web resource: Amazon EC2, http://aws.amazon.com/ec2/

  12. Vladislavleva, E., Smits, G., Den Hertog, D.: Order of nonlinearity as a complexity measure for models generated by symbolic regression via pareto genetic programming. IEEE Transactions on Evolutionary Computation 13(2), 333–349 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Systems and Robotics, IST, Lisbon, Portugal

    Pedro Fazenda

  2. Evolutionary Design and Optimization Group, CSAIL, MIT, USA

    Pedro Fazenda, James McDermott & Una-May O’Reilly

Authors
  1. Pedro Fazenda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James McDermott
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Una-May O’Reilly
    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. Financial Mathematics and Computation Cluster Natural Computing Research and Applications Group Complex and Adaptive Systems Laboratory, University College, Dublin, Ireland

    Alexandros Agapitos

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

    Stefano Cagnoni

  4. ETSI Informática, Universidad de Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  5. Centro Universitario de Merida, Universidad de Extremadura, Spain

    Francisco Fernández de Vega

  6. Dalle Molle Institute for Artificial Intelligence (IDSIA), Lugano, Switzerland

    Gianni A. Di Caro

  7. DFKI Bremen, Cyber-Physical Systems, Bremen, Germany

    Rolf Drechsler

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

    Anikó Ekárt

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

    Anna I. Esparcia-Alcázar

  10. Next Generation Intelligent Networks Research Center (nexGIN RC), National University of Computer & Emerging Sciences (FAST-NU), Islamabad, Pakistan

    Muddassar Farooq

  11. Department of Computer Science,, University College London, Gower Street, WC1E 6BT, London, UK

    William B. Langdon

  12. Depto. Arquitectura y Tecnologa de Computadores, ETS Ingeiera Informtica, C/Daniel Saucedo Aranda, s/n, 18071, Granada, Spain

    Juan J. Merelo-Guervós

  13. Chair of Algorithm Engineering, Computational Intelligence Group, Dept. of Computer Science, Technische Universität Dortmund, Germany

    Mike Preuss

  14. HTWK Leipzig, Fakultät Elektrotechnik und Informationstechnik, Institut Mess–, Steuerungs– und Regelungstechnik, Postfach 30 11 66, D–04251, Leipzig, Germany

    Hendrik Richter

  15. INESC-ID Lisboa, Rua Alves Redol 9,, 1000-029, Lisboa, Portugal

    Sara Silva

  16. Centre for Informatics and Systems, University of Coimbra, Portugal

    Anabela Simões

  17. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

  18. Institute of High Performance Computing and Networking, ICAR-CNR, Naples, Italy

    Ernesto Tarantino

  19. Dipartimento di Tecnologie dell’Informazione, Universita’ degli Studi di Milano, Italy

    Andrea G. B. Tettamanzi

  20. IT University of Copenhagen, Rued Langaards Vej 7, 2300, Copenhagen, Denmark

    Julian Togelius

  21. Centre for Emergent Computing, Edinburgh Napier University, Edinburgh,, UK

    Neil Urquhart

  22. Department of Computer Engineering, Istanbul Technical University, 34490, Maslak, Turkey

    A. Şima Uyar

  23. Center For Computer Games Research, IT University Of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Georgios N. Yannakakis

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fazenda, P., McDermott, J., O’Reilly, UM. (2012). A Library to Run Evolutionary Algorithms in the Cloud Using MapReduce. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2012. Lecture Notes in Computer Science, vol 7248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29178-4_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29178-4_42

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics