Advertisement

Fast Hybrid BSA-DE-SA Algorithm on GPU

  • Mathieu BrévilliersEmail author
  • Omar Abdelkafi
  • Julien Lepagnot
  • Lhassane Idoumghar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10103)

Abstract

This paper introduces a hybridization of Backtracking Search Optimization Algorithm (BSA) with Differential Evolution (DE) and Simulated Annealing (SA) in order to improve the convergence speed of BSA. An experimental study, conducted on 20 benchmark problems, shows that this approach outperforms BSA and two other hybridizations [4, 18], in terms of solution quality and convergence speed. We also describe our CUDA implementation of this algorithm for graphics processing unit (GPU). Experimental results are reported for 10 high-dimensional benchmark problems, and it highlights that significant speedup can be achieved.

Keywords

Continuous optimization Hybrid metaheuristic Backtracking search optimization algorithm Differential evolution Simulated annealing Graphics processing unit CUDA 

References

  1. 1.
    Brest, J., Greiner, S., Boskovic, B., Mernik, M., Zumer, V.: Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans. Evol. Comput. 10(6), 646–657 (2006)CrossRefGoogle Scholar
  2. 2.
    Brévilliers, M., Abdelkafi, O., Lepagnot, J., Idoumghar, L.: Idol-guided backtracking search optimization algorithm. In: 12th International Conference on Artificial Evolution (EA 2015), Lyon, France, October 2015Google Scholar
  3. 3.
    Civicioglu, P.: Backtracking search optimization algorithm for numerical optimization problems. Appl. Math. Comput. 219(15), 8121–8144 (2013)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Das, S., Mandal, D., Kar, R., Ghoshal, S.P.: A new hybridized backtracking search optimization algorithm with differential evolution for sidelobe suppression of uniformly excited concentric circular antenna arrays. Int. J. RF Microwave Comput. Aided Eng. 25(3), 262–268 (2015)CrossRefGoogle Scholar
  5. 5.
    Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159–195 (2001)CrossRefGoogle Scholar
  6. 6.
    Idoumghar, L., Idrissi-Aouad, M., Melkemi, M., Schott, R.: Metropolis particle swarm optimization algorithm with mutation operator for global optimization problems. In: 2010 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), vol. 1, pp. 35–42, October 2010Google Scholar
  7. 7.
    Kalivarapu, V., Winer, E.: A study of graphics hardware accelerated particle swarm optimization with digital pheromones. Struct. Multidisc. Optim. 51(6), 1281–1304 (2015)CrossRefGoogle Scholar
  8. 8.
    Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459–471 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10(3), 281–295 (2006)CrossRefGoogle Scholar
  10. 10.
    Lin, Q., Gao, L., Li, X., Zhang, C.: A hybrid backtracking search algorithm for permutation flow-shop scheduling problem. Comput. Ind. Eng. 85, 437–446 (2015)CrossRefGoogle Scholar
  11. 11.
    Luo, G.-H., Huang, S.-K., Chang, Y.-S., Yuan, S.-M.: A parallel bees algorithm implementation on GPU. J. Syst. Archit. 60(3), 271–279 (2014)CrossRefGoogle Scholar
  12. 12.
    Pospichal, P., Jaros, J., Schwarz, J.: Parallel genetic algorithm on the CUDA architecture. In: Chio, C., et al. (eds.) EvoApplications 2010. LNCS, vol. 6024, pp. 442–451. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-12239-2_46 CrossRefGoogle Scholar
  13. 13.
    Price, K.: An introduction to differential evolution. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 79–108. McGraw-Hill Ltd., London (1999)Google Scholar
  14. 14.
    Qin, A.K., Suganthan, P.N.: Self-adaptive differential evolution algorithm for numerical optimization. In: The 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1785–1791 (2005)Google Scholar
  15. 15.
    Storn, R., Price, K.: Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341–359 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Syed, M.S., Injeti, S.K.: Simultaneous optimal placement of DGs and fixed capacitor banks in radial distribution systems using BSA optimization. Int. J. Comput. Appl. 108(5), 28–35 (2014)Google Scholar
  17. 17.
    Tanabe, R., Fukunaga, A.: Success-history based parameter adaptation for differential evolution. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 71–78, June 2013Google Scholar
  18. 18.
    Wang, L., Zhong, Y., Yin, Y., Zhao, W., Wang, B., Xu, Y.: A hybrid backtracking search optimization algorithm with differential evolution. Math. Probl. Eng. 2015, 16 (2015). doi: 10.1155/2015/769245. Article ID 769245Google Scholar
  19. 19.
    Zambrano-Bigiarini, M., Clerc, M., Rojas, R.: Standard particle swarm optimisation: a baseline for future PSO improvements. In: 2013 IEEE Congress on Evolutionary Computation, pp. 2337–2344, June 2013Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Mathieu Brévilliers
    • 1
    Email author
  • Omar Abdelkafi
    • 1
  • Julien Lepagnot
    • 1
  • Lhassane Idoumghar
    • 1
  1. 1.Université de Haute-Alsace (UHA), LMIA (E.A. 3993)MulhouseFrance

Personalised recommendations