Skip to main content
SpringerLink
Log in

Parallel evolutionary algorithms based on shared memory programming approaches

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In this work, two parallel techniques based on shared memory programming are presented. These models are specially suitable to be applied over evolutionary algorithms. To study their performance, the algorithm UEGO (Universal Evolutionary Global Optimizer) has been chosen.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alba E (2005) Parallel metaheuristics: a new class of algorithms. Wiley-Interscience, New York

    Book  MATH  Google Scholar 

  2. Hooker JN (1995) Testing heuristics: we have it all wrong. J Heuristics 1(1):33–42

    Article  MathSciNet  MATH  Google Scholar 

  3. Jelásity M, Ortigosa P, García I (2001) UEGO, an abstract clustering technique for multimodal global optimization. J Heuristics 7(3):215–233

    Article  MATH  Google Scholar 

  4. Kicinger R, Arciszewski T, Jong KD (2005) Evolutionary computation and structural design: a survey of the state of the art. Comput Struct 83(23–24):1943–1978

    Google Scholar 

  5. Ortigosa P, Redondo J, García I, Fernández J (2007) A population global optimization algorithm to solve the image alignment problem in electron crystallography. J Glob Optim 37(4):527–539

    Article  MATH  Google Scholar 

  6. Redondo JL (2008) Solving competitive location problems via memetic algorithms. High performance computing approaches. Ph.D. thesis, Universidad de Almería

  7. Redondo J, Ortigosa P, García I, Fernández J (2004) Image registration in electron microscopy. A stochastic optimization approach. In: Proceedings of the international conference on image analysis and recognition, ICIAR 2004. Lecture notes in computer science, vol 3212(II). Springer, Berlin, pp 141–149

    Google Scholar 

  8. Redondo J, García I, Ortigosa P, Pelegrín B, Fernández P (2006) Parallelization of an algorithm for finding facility locations for an entering firm under delivered pricing. In: G Joubert, W Nagel, F Peters, O Plata, P Tirado, E Zapata (eds) Parallel computing: current and future issues of high-end computing. NIC series, vol 33. John von Neumann Institute for Computing, pp 269–276

  9. Redondo J, Fernández J, García I, Ortigosa P (2008) Parallel algorithms for continuous competitive location problems. Optim Methods Softw 23(5):779–791

    Article  MathSciNet  MATH  Google Scholar 

  10. Redondo J, Fernández J, García I, Ortigosa P (2009) Parallel algorithms for multifacilities continuous competitive location problems. J Glob Optim (in press)

  11. Redondo J, Fernández J, García I, Ortigosa P (2009) Solving the multiple competitive location and design problem on the plane. Evol Comput 17(1):21–53

    Article  Google Scholar 

  12. Redondo J, Fernández J, García I, Ortigosa P (2009) Heuristics for the facility location and design (1|1)-centroid problem on the plane. Comput Optim Appl. Available online doi:10.1007/s10589-008-9170-0

  13. Redondo J, Fernández J, García I, Ortigosa P (2009) A robust and efficient global optimization algorithm for planar competitive location problems. Ann Oper Res 167:87–106

    Article  MathSciNet  Google Scholar 

  14. Solis F, Wets R (1981) Minimization by random search techniques. Math Oper Res 6(1):19–30

    Article  MathSciNet  MATH  Google Scholar 

  15. Tórn A, Zilinskas A (1989) Global optimization. Springer, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpt. Computer Architecture and Electronics, University of Almería, Almeria, Spain

    J. L. Redondo, I. García & P. M. Ortigosa

Authors
  1. J. L. Redondo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. García
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. M. Ortigosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. L. Redondo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Redondo, J.L., García, I. & Ortigosa, P.M. Parallel evolutionary algorithms based on shared memory programming approaches. J Supercomput 58, 270–279 (2011). https://doi.org/10.1007/s11227-009-0374-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-009-0374-6

Search

Navigation