Skip to main content

Advertisement

Log in

Central force optimization on a GPU: a case study in high performance metaheuristics

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

Abstract

Central Force Optimization (CFO) is a new and deterministic population based metaheuristic algorithm that has been demonstrated to be competitive with other metaheuristic algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), and Group Search Optimization (GSO). While CFO often shows superiority in terms of functional evaluations and solution quality, the algorithm is complex and typically requires increased computational time. In order to decrease the computational time required for convergence when using CFO, this study presents the first parallel implementation of CFO on a Graphics Processing Unit (GPU) using the NVIDIA Compute Unified Device Architecture (CUDA). Two versions of the CFO algorithm, Parameter-Free CFO (PF-CFO) and Pseudo-Random CFO (PR-CFO), are implemented using CUDA on a NVIDIA Quadro 1000M and examined using four test problems ranging from 10 to 50 dimensions. Discussion is made concerning the implementation of the CFO algorithms in terms of problem decomposition, memory access, scalability, and divergent code. Results demonstrate substantial speedups ranging from roughly 1 to 28 depending on problem size and complexity.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alba E, Luque G (2006) Evaluation of parallel metaheuristics. In: PPSN-EMAA’06, Reykjavik, Iceland, pp 9–14

    Google Scholar 

  2. Cardenas-Montes M, Vega-Rodriguez MA, Rodriguez-Vazquez JJ, Gomez-Iglesias A (2011) Effect of the block occupancy in GPGPU over the performance of particle swarm algorithm. In: Proceedings of the 10th international conference on adaptive and natural computing algorithms (ICANNGA’11), Ljubljana, Slovenia. Springer, Berlin, pp 310–319

    Chapter  Google Scholar 

  3. Formato RA (2007) Central force optimization: a new metaheuristic with applications in applied electromagnetics. Prog Electromagn Res 77:425–491

    Article  Google Scholar 

  4. Formato RA (2007) Central force optimization: a new nature inspired computational framework for multidimensional search and optimization. In: NICSO. Springer, Berlin, pp 221–238

    Google Scholar 

  5. Formato RA (2009) Central force optimisation: a new gradient-like metaheuristic for multidimensional search and optimisation. Int J Bio-Insp Comput 1(4):217–238

    Article  Google Scholar 

  6. Formato RA (2009) Central force optimization: a new deterministic gradient-like optimization metaheuristic OPSEARCH. J Oper Res Soc India 46(1):25–51

    MathSciNet  MATH  Google Scholar 

  7. Formato RA (2010) Central force optimization applied to the PBM suite of antenna benchmarks. Computing Research Repository abs/1003.0221

  8. Formato RA (2010) Comparative results: Group search optimizer and central force optimization. Computing Research Repository abs/1002.2798

  9. Formato RA (2010) Improved CFO algorithm for antenna optimization. Prog Electromagn Res 19:405–425

    Article  Google Scholar 

  10. Formato RA (2010) Parameter-free deterministic global search with central force optimization. Computing Research Repository abs/1003.1039

  11. Formato RA (2010) Pseudorandomness in central force optimization. Computing Research Repository abs/1001.0317

  12. Green R, Wang L, Alam M (2012) Training neural networks using central force optimization and particle swarm optimization: insights and comparisons. Expert Syst Appl 39(1):555–563

    Article  Google Scholar 

  13. Khronos OpenCL Working Group (2008) The OpenCL Specification, version 1.0.29

  14. Kirk DB, Hwu WmW (2010) Programming massively parallel processors: a hands-on approach, 1 edn. Applications of GPU computing series. San Mateo, Morgan Kaufmann

    Google Scholar 

  15. Mohammad G, Dib N (2009) Synthesis of antenna arrays using central force optimization. In: Mosharaka international conference on communications, computers and applications

    Google Scholar 

  16. NVIDIA Corporation (2011) NVIDIA CUDA C programming best practices guide. Tech rep

  17. NVIDIA Corporation (2011) NVIDIA CUDA C programming guide 4.0. Tech rep

  18. Owens JD, Luebke D, Govindaraju N, Harris M, Krüger J, Lefohn A, Purcell TJ (2007) A survey of general-purpose computation on graphics hardware. Comput Graph Forum 26:80–113

    Article  Google Scholar 

  19. Pantoja M, Bretones A, Martin R (2007) Benchmark antenna problems for evolutionary optimization algorithms. IEEE Trans Antennas Propag 55(4):1111–1121

    Article  Google Scholar 

  20. Qubati G (2009) Central force optimization method and its application to the design of antennas. Master’s thesis, Jordan University of Science and Technology

  21. Qubati GM, Dib NI (2010) Microstip patch antenna optimization using modified central force optimization. Prog Electromagn Res 21:281–298

    Google Scholar 

  22. Sanders J, Kandrot E (2010) CUDA by example: an introduction to general-purpose GPU programming, 1 edn. Addison-Wesley, Reading

    Google Scholar 

  23. Zhou Y, Tan Y (2009) GPU-based parallel particle swarm optimization. In: IEEE congress on evolutionary computation, pp 1493–1500

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lingfeng Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Green, R.C., Wang, L., Alam, M. et al. Central force optimization on a GPU: a case study in high performance metaheuristics. J Supercomput 62, 378–398 (2012). https://doi.org/10.1007/s11227-011-0725-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-011-0725-y

Keywords

Navigation