Skip to main content

Generic Local Search (Memetic) Algorithm on a Single GPGPU Chip

  • Chapter
  • First Online:
Massively Parallel Evolutionary Computation on GPGPUs

Part of the book series: Natural Computing Series ((NCS))

Abstract

Memetic algorithms (MAs), evolutionary algorithms coupled with a local search routine, have been shown to be very efficient in solving a great variety of problems. This chapter presents the first implementation of a generic parallel MA on a general-purpose graphics processing unit card. An upgrade of the EASEA platform provides an automatic generation and parallelization of an MA for both novice and experienced users. Experiments on a benchmark function and a real-world problem reveal speedups ranging between × 70 and × 120, depending on population size and number of local search iterations.

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 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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.

    http://easea.unistra.fr

  2. 2.

    www.gefore.com/Hardware/GPUs/gefore-gtx-295

References

  1. Baumes, L.A., Krüger, F., Collet, P.: Using large scale parallel systems for complex crystallographic problems in materials science. In: Tsutsui, S., Collet, P. (eds.) Massively Parallel Evolutionary Computation on GPGPUs. Springer, Heidelberg (2013). doi:10.1007/978-3-642-37959-8

    Google Scholar 

  2. Collet, P., Lutton, E., Schoenauer, M., Louchet, J.: Take it EASEA. In: PPSN 2000. Lecture Notes in Computer Science, vol. 1917, pp. 891–901. Springer, Berlin (2000)

    Google Scholar 

  3. Corma, A., Moliner, M., Serra, J.M., Serna, P., Diaz-Cabana, M.J., Baumes, L.A.: A new mapping/exploration approach for HT synthesis of zeolites. Chem. Mater. 18, 3287–3296 (2006)

    Article  Google Scholar 

  4. Dawkins, R.: The Selfish Gene. Oxford University Press, Oxford (1989).

    Google Scholar 

  5. De Jong, K.A.: Evolutionary Computation, a Unified Approach. MIT Press, Cambridge (2006). ISBN 0-262-04194-4

    MATH  Google Scholar 

  6. Hart, W.E., Krasnogor, N., Smith, J.E.: Recent Advances in Memetic Algorithms. Springer, Heidelberg (2005)

    Book  MATH  Google Scholar 

  7. Langdon, W.B.: A fast high quality pseudo random number generator for graphics processing units. IEEE World Congress on Computational Intelligence, Hong Kong, pp. 459–465 (2008)

    Google Scholar 

  8. Luo, Z., Liu, H.: Cellular genetic algorithms and local search for 3-SAT problem on graphic hardware. IEEE Congress on Evolutionary Computation CEC 2006, Vancouver, pp. 2988–2992 (2006)

    Google Scholar 

  9. Maitre, O., Baumes, L.A., Lachiche, N., Corma, A., Collet, P.: Coarse grain parallelization of evolutionary algorithms on GPGPU cards with EASEA. In: GECCO, pp. 1403–1410 (2009)

    Google Scholar 

  10. Maitre, O., Kruger, F., Querry, S., Lachiche, N., Collet, P.: EASEA: specification and execution of evolutionary algorithms on GPGPU. J. Soft Comput. 16(2), 261–179 (2012)

    Article  Google Scholar 

  11. Maitre, O., Lachiche, N., Collet, P.: Fast evaluation of GP trees on GPGPU by optimizing hardware scheduling. In: EuroGP 2010. Lecture Notes in Computer Science, vol. 6021, pp. 301–312. Springer, Heidelberg (2010)

    Google Scholar 

  12. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program (report 826) (1989)

    Google Scholar 

  13. Munawar, A., Wahib, M., Munetomo, M., Akama, K.: Hybrid of genetic algorithm and local search to solve MAX-SAT problem using NVIDIA CUDA framework. Genet. Program. Evol. Mach. 10(4), 391–415 (2009)

    Article  Google Scholar 

  14. Pereira, F.B., Costa, E.: Understanding the role of learning in the evolution of Busy Beavers: a comparison between the Baldwin Effect and a Lamarckian strategy. In: Proceeding of the Genetic and Evolutionary Computation Conference (2001)

    Google Scholar 

  15. Rosenbrock, H.H.: An automatic method for finding the greatest or least value of a function. Comput. J. 3, 175–184 (1960). doi:10.1093/comjnl/3.3.175

    Article  MathSciNet  Google Scholar 

  16. Shang, Y.W., Qiu, Y.H.: A note on the extended Rosenbrock function. Evol. Comput. 14(1), 119–126 (2006)

    Article  Google Scholar 

  17. Wong, M., Wong, T.: Parallel hybrid genetic algorithms on consumer-level graphics hardware. IEEE Congress on Evolutionary Computation CEC 2006, pp. 2973–2980 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frédéric Krüger .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Krüger, F., Maitre, O., Jiménez, S., Baumes, L.A., Collet, P. (2013). Generic Local Search (Memetic) Algorithm on a Single GPGPU Chip. In: Tsutsui, S., Collet, P. (eds) Massively Parallel Evolutionary Computation on GPGPUs. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37959-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37959-8_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37958-1

  • Online ISBN: 978-3-642-37959-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics