Skip to main content
Erschienen in: International Journal of Machine Learning and Cybernetics 11/2019

26.08.2019 | Original Article

An ensemble bat algorithm for large-scale optimization

verfasst von: Xingjuan Cai, Jiangjiang Zhang, Hao Liang, Lei Wang, Qidi Wu

Erschienen in: International Journal of Machine Learning and Cybernetics | Ausgabe 11/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

It is difficult for the bat algorithm (BA) to retain good performance with increasing problem complexity and problem. In this paper, an ensemble BA is proposed to solve large-scale optimization problems (LSOPs) by introducing the integration ideas. The characteristics of six improved BA strategies are taken into account for the ensemble strategies. To fuse these strategies perfectly, the probability selection mechanisms, including the constant probability and dynamic probability, are designed by adjusting the odds of different strategies. To verify the performance of the algorithm in this paper, the proposed algorithm is applied to solve numerical optimization problems on benchmark functions with different dimensions. Then, the best ensemble BA is selected by comparing the constant probabilities and dynamic probabilities. The selected algorithm is compared with other excellent swarm intelligence optimization algorithms. Additionally, the superiority of the proposed algorithm is confirmed for solving LSOPs.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Weitere Produktempfehlungen anzeigen
Literatur
1.
Zurück zum Zitat Yu WX, Wang J (2018) A new method to solve optimisation problems via fixed point of firefly algorithm. Int J Bio-Inspired Comput 11(4):249–256CrossRef Yu WX, Wang J (2018) A new method to solve optimisation problems via fixed point of firefly algorithm. Int J Bio-Inspired Comput 11(4):249–256CrossRef
2.
Zurück zum Zitat Wang G-G, Deb S, Coelho LDS (2018) Earthworm optimisation algorithm: a bio-inspired metaheuristic algorithm for global optimisation problems. Int J Bio-Inspired Comput 12(1):1–22CrossRef Wang G-G, Deb S, Coelho LDS (2018) Earthworm optimisation algorithm: a bio-inspired metaheuristic algorithm for global optimisation problems. Int J Bio-Inspired Comput 12(1):1–22CrossRef
3.
Zurück zum Zitat Jie W, Jiangjun Y (2018) A high-efficient multi-deme genetic algorithm with better load-balance. Int J Comput Sci Math 9(3):240–246CrossRef Jie W, Jiangjun Y (2018) A high-efficient multi-deme genetic algorithm with better load-balance. Int J Comput Sci Math 9(3):240–246CrossRef
4.
Zurück zum Zitat Abdel-Baset M, Zhou Y, Ismail M (2018) An improved cuckoo search algorithm for integer programming problems. Int J Comput Sci Math 9(1):66–81MathSciNetCrossRef Abdel-Baset M, Zhou Y, Ismail M (2018) An improved cuckoo search algorithm for integer programming problems. Int J Comput Sci Math 9(1):66–81MathSciNetCrossRef
5.
Zurück zum Zitat Arloff W, Schmitt RK, Venstrom LJ (2018) A parameter estimation method for stiff ordinary differential equations using particle swarm optimisation. Int J Comput Sci Math 9(5):419–432MathSciNetCrossRef Arloff W, Schmitt RK, Venstrom LJ (2018) A parameter estimation method for stiff ordinary differential equations using particle swarm optimisation. Int J Comput Sci Math 9(5):419–432MathSciNetCrossRef
6.
Zurück zum Zitat Raj ED, Babu LDD (2018) A firefly inspired game dissemination and QoS-based priority pricing strategy for online social network games. Int J Bio-Inspired Comput 11(3):202–217CrossRef Raj ED, Babu LDD (2018) A firefly inspired game dissemination and QoS-based priority pricing strategy for online social network games. Int J Bio-Inspired Comput 11(3):202–217CrossRef
7.
Zurück zum Zitat Lv L, Fan T, Li Q, Sun Z, Lizhong X (2018) Object tracking with improved firefly algorithm. Int J Comput Sci Math 9(3):219–231MathSciNetCrossRef Lv L, Fan T, Li Q, Sun Z, Lizhong X (2018) Object tracking with improved firefly algorithm. Int J Comput Sci Math 9(3):219–231MathSciNetCrossRef
8.
Zurück zum Zitat Yu G, Feng Y (2018) Improving firefly algorithm using hybrid strategies. Int J Comput Sci Math 9(2):163–170MathSciNetCrossRef Yu G, Feng Y (2018) Improving firefly algorithm using hybrid strategies. Int J Comput Sci Math 9(2):163–170MathSciNetCrossRef
9.
Zurück zum Zitat Cui Z, Sun B, Xue Y, Wang G, Chen J (2017) A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber-physical systems. J Parallel Distrib Comput 103:42–52CrossRef Cui Z, Sun B, Xue Y, Wang G, Chen J (2017) A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber-physical systems. J Parallel Distrib Comput 103:42–52CrossRef
10.
Zurück zum Zitat Niu Y, Tian Z, Zhang M, Cai X, Li J (2018) Adaptive two-SVM multi-objective cuckoo search algorithm for software defect prediction. Int J Comput Sci Math 9(6):547–554MathSciNetCrossRef Niu Y, Tian Z, Zhang M, Cai X, Li J (2018) Adaptive two-SVM multi-objective cuckoo search algorithm for software defect prediction. Int J Comput Sci Math 9(6):547–554MathSciNetCrossRef
11.
Zurück zum Zitat Zhang M, Wang H, Cui Z, Chen J (2018) Hybrid multi-objective cuckoo search with dynamical local search. Memet Comput 10:199–208CrossRef Zhang M, Wang H, Cui Z, Chen J (2018) Hybrid multi-objective cuckoo search with dynamical local search. Memet Comput 10:199–208CrossRef
12.
Zurück zum Zitat Cortés P, Muñuzuri J, Onieva L, Guadix J (2018) A discrete particle swarm optimisation algorithm to operate distributed energy generation networks efficiently. Int J Bio-Inspired Comput 12(4):226–235CrossRef Cortés P, Muñuzuri J, Onieva L, Guadix J (2018) A discrete particle swarm optimisation algorithm to operate distributed energy generation networks efficiently. Int J Bio-Inspired Comput 12(4):226–235CrossRef
13.
Zurück zum Zitat Bougherara M, Nedjah N, De LZ (2018) IP assignment for efficient NoC-based system design using multi-objective particle swarm optimisation. Int J Bio-Inspired Comput 12(4):203–213CrossRef Bougherara M, Nedjah N, De LZ (2018) IP assignment for efficient NoC-based system design using multi-objective particle swarm optimisation. Int J Bio-Inspired Comput 12(4):203–213CrossRef
15.
Zurück zum Zitat Li G, Cui L, Fu X, Wen Z, Lu N, Lu J (2017) Artificial bee colony algorithm with gene recombination for numerical function optimization. Appl Soft Comput 52:146–159CrossRef Li G, Cui L, Fu X, Wen Z, Lu N, Lu J (2017) Artificial bee colony algorithm with gene recombination for numerical function optimization. Appl Soft Comput 52:146–159CrossRef
16.
Zurück zum Zitat Cui Z, Li F, Zhang W (2019) Bat algorithm with principal component analysis. Int J Mach Learn Cybern 10(3):603–622CrossRef Cui Z, Li F, Zhang W (2019) Bat algorithm with principal component analysis. Int J Mach Learn Cybern 10(3):603–622CrossRef
17.
Zurück zum Zitat Cai X, Gao X, Xue Y (2016) Improved bat algorithm with optimal forage strategy and random disturbance strategy. Int J Bio-inspired Comput 8(4):205–214CrossRef Cai X, Gao X, Xue Y (2016) Improved bat algorithm with optimal forage strategy and random disturbance strategy. Int J Bio-inspired Comput 8(4):205–214CrossRef
18.
Zurück zum Zitat Cui L, Li G, Zhu Z, Lin Q, Wong K-C, Chen J, Lu N, Lu J (2018) Adaptive multiple-elites-guided composite differential evolution algorithm with a shift mechanism. Inf Sci 422:122–143MathSciNetCrossRef Cui L, Li G, Zhu Z, Lin Q, Wong K-C, Chen J, Lu N, Lu J (2018) Adaptive multiple-elites-guided composite differential evolution algorithm with a shift mechanism. Inf Sci 422:122–143MathSciNetCrossRef
19.
Zurück zum Zitat Cui L, Li G, Lin Q, Chen J, Lu N (2016) Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations. Comput Oper Res 67:155–173MathSciNetMATHCrossRef Cui L, Li G, Lin Q, Chen J, Lu N (2016) Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations. Comput Oper Res 67:155–173MathSciNetMATHCrossRef
20.
Zurück zum Zitat Zhou G, Zhao R, Zhou Y (2018) Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm. Int J Comput Sci Math 9(5):433–441MathSciNetCrossRef Zhou G, Zhao R, Zhou Y (2018) Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm. Int J Comput Sci Math 9(5):433–441MathSciNetCrossRef
21.
Zurück zum Zitat Cui Z, Du L, Wang P, Cai X, Zhang W (2019) Malicious code detection based on CNNs and multi-objective algorithm. J Parallel Distrib Comput 129:50–58CrossRef Cui Z, Du L, Wang P, Cai X, Zhang W (2019) Malicious code detection based on CNNs and multi-objective algorithm. J Parallel Distrib Comput 129:50–58CrossRef
22.
Zurück zum Zitat Wang P, Xue F, Li H, Cui Z, Xie L, Chen J (2019) A multi-objective DV-Hop localization algorithm based on NSGA-II in internet of things. Mathematics 7(2):184CrossRef Wang P, Xue F, Li H, Cui Z, Xie L, Chen J (2019) A multi-objective DV-Hop localization algorithm based on NSGA-II in internet of things. Mathematics 7(2):184CrossRef
23.
Zurück zum Zitat Cui Z, Chang Y, Zhang J, Cai X, Zhang W (2019) Improved NSGA-III with selection-and-elimination operator. Swarm Evol Comput 49:23–33CrossRef Cui Z, Chang Y, Zhang J, Cai X, Zhang W (2019) Improved NSGA-III with selection-and-elimination operator. Swarm Evol Comput 49:23–33CrossRef
26.
Zurück zum Zitat Wang R, Zhang F, Zhang T, Fleming PJ (2018) Cooperative co-evolution with improved differential grouping method for large-scale global optimisation. Int J Bio-Inspired Comput 12(4):214–225CrossRef Wang R, Zhang F, Zhang T, Fleming PJ (2018) Cooperative co-evolution with improved differential grouping method for large-scale global optimisation. Int J Bio-Inspired Comput 12(4):214–225CrossRef
27.
Zurück zum Zitat Amiri E, Dehkordi MN (2018) Dynamic data clustering by combining improved discrete artificial bee colony algorithm with fuzzy logic. Int J Bio-Inspired Comput 12(3):164–172CrossRef Amiri E, Dehkordi MN (2018) Dynamic data clustering by combining improved discrete artificial bee colony algorithm with fuzzy logic. Int J Bio-Inspired Comput 12(3):164–172CrossRef
29.
Zurück zum Zitat Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102CrossRef Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102CrossRef
30.
31.
Zurück zum Zitat Mallipeddi RS, Ponnuthurai N (2010) Ensemble of Constraint Handling Techniques. IEEE Trans Evol Comput 14:561–579CrossRef Mallipeddi RS, Ponnuthurai N (2010) Ensemble of Constraint Handling Techniques. IEEE Trans Evol Comput 14:561–579CrossRef
32.
Zurück zum Zitat Saranya G, Nehemiah HK, Kannan A (2018) Hybrid particle swarm optimisation with mutation for code smell detection. Int J Bio-Inspired Comput 12(3):186–195CrossRef Saranya G, Nehemiah HK, Kannan A (2018) Hybrid particle swarm optimisation with mutation for code smell detection. Int J Bio-Inspired Comput 12(3):186–195CrossRef
34.
Zurück zum Zitat Tasgetiren MF, Suganthan PN, Pan QK (2010) An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl Math Comput 215:3356–3368MathSciNetMATH Tasgetiren MF, Suganthan PN, Pan QK (2010) An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl Math Comput 215:3356–3368MathSciNetMATH
35.
Zurück zum Zitat Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput 11:1679–1696CrossRef Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput 11:1679–1696CrossRef
36.
Zurück zum Zitat Zhao SZ, Suganthan PN, Zhang Q (2012) Decomposition-based multiobjective evolutionary algorithm with an ensemble of neighborhood sizes. IEEE Trans Evol Comput 16:442–446CrossRef Zhao SZ, Suganthan PN, Zhang Q (2012) Decomposition-based multiobjective evolutionary algorithm with an ensemble of neighborhood sizes. IEEE Trans Evol Comput 16:442–446CrossRef
37.
Zurück zum Zitat Zhao B, Xue Y, Xu B, Ma T, Liu J (2018) Multi-objective classification based on NSGA-II. Int J Comput Sci Math 9(6):539–546MathSciNetCrossRef Zhao B, Xue Y, Xu B, Ma T, Liu J (2018) Multi-objective classification based on NSGA-II. Int J Comput Sci Math 9(6):539–546MathSciNetCrossRef
38.
Zurück zum Zitat Mallipeddi R, Mallipeddi S, Suganthan PN (2010) Ensemble strategies with adaptive evolutionary programming. Inf Sci 180:1571–1581MATHCrossRef Mallipeddi R, Mallipeddi S, Suganthan PN (2010) Ensemble strategies with adaptive evolutionary programming. Inf Sci 180:1571–1581MATHCrossRef
39.
Zurück zum Zitat Wang H, Zhijian W, Rahnamayan S, Sun H, Liu Y, Pan J (2014) Multi-strategy ensemble artificial bee colony algorithm. Inf Sci 279:587–603MathSciNetMATHCrossRef Wang H, Zhijian W, Rahnamayan S, Sun H, Liu Y, Pan J (2014) Multi-strategy ensemble artificial bee colony algorithm. Inf Sci 279:587–603MathSciNetMATHCrossRef
40.
Zurück zum Zitat Tasgetiren MF, Suganthan PN, Pan QK (2010) An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl Math Comput 215:3356–3368MathSciNetMATH Tasgetiren MF, Suganthan PN, Pan QK (2010) An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl Math Comput 215:3356–3368MathSciNetMATH
41.
Zurück zum Zitat Cui Z, Cao Y, Cai X, Cai J, Chen J (2019) Optimal LEACH protocol with modified bat algorithm for big data sensing systems in Internet of things. J Parallel Distrib Comput 132:217–229CrossRef Cui Z, Cao Y, Cai X, Cai J, Chen J (2019) Optimal LEACH protocol with modified bat algorithm for big data sensing systems in Internet of things. J Parallel Distrib Comput 132:217–229CrossRef
43.
Zurück zum Zitat Yang XS (2010) A new metaheuristic bat-inspired algorithm. Comput Knowl Technol 284:65–74MATH Yang XS (2010) A new metaheuristic bat-inspired algorithm. Comput Knowl Technol 284:65–74MATH
44.
Zurück zum Zitat Cui Z, Xue F, Cai X, Cao Y, Wang G, Chen J (2018) Detection of malicious code variants based on deep learning. IEEE Trans Ind Inf 14(7):3178–3196CrossRef Cui Z, Xue F, Cai X, Cao Y, Wang G, Chen J (2018) Detection of malicious code variants based on deep learning. IEEE Trans Ind Inf 14(7):3178–3196CrossRef
45.
Zurück zum Zitat Khan K, Nikov A, Sahai A (2011) A fuzzy bat clustering method for ergonomic screening of office workplaces. In: Third international conference on software, services and semantic technologies S3T 2011. Bourgas, Bulgaria, pp 59–66 Khan K, Nikov A, Sahai A (2011) A fuzzy bat clustering method for ergonomic screening of office workplaces. In: Third international conference on software, services and semantic technologies S3T 2011. Bourgas, Bulgaria, pp 59–66
46.
Zurück zum Zitat Bahmani-Firouzi B, Azizipanah-Abarghooee R (2014) Optimal sizing of battery energy storage for micro-grid operation management using a new improved bat algorithm. Int J Electr Power Energy Syst 56:42–54CrossRef Bahmani-Firouzi B, Azizipanah-Abarghooee R (2014) Optimal sizing of battery energy storage for micro-grid operation management using a new improved bat algorithm. Int J Electr Power Energy Syst 56:42–54CrossRef
47.
Zurück zum Zitat Cai X, Wang H, Cui Z, Cai J, Xue Y, Wang L (2018) Bat algorithm with triangle-flipping strategy for numerical optimization. Int J Mach Learn Cybern 9(2):199–215CrossRef Cai X, Wang H, Cui Z, Cai J, Xue Y, Wang L (2018) Bat algorithm with triangle-flipping strategy for numerical optimization. Int J Mach Learn Cybern 9(2):199–215CrossRef
48.
Zurück zum Zitat Zhang M, Cui Z, Chang Y, Ren Y, Cai X, Wang H (2018) Bat algorithm with individual local search. In: International conference on intelligence science, pp 442–451CrossRef Zhang M, Cui Z, Chang Y, Ren Y, Cai X, Wang H (2018) Bat algorithm with individual local search. In: International conference on intelligence science, pp 442–451CrossRef
49.
Zurück zum Zitat Cai X, Wang L, Kang Q, Qidi W (2014) Bat algorithm with Gaussian walk. Int J Bio-Inspired Comput 6(3):166–174CrossRef Cai X, Wang L, Kang Q, Qidi W (2014) Bat algorithm with Gaussian walk. Int J Bio-Inspired Comput 6(3):166–174CrossRef
50.
Zurück zum Zitat Hadigheh AG, Terlaky T (2006) Sensitivity analysis in linear optimization: invariant support set intervals. Eur J Oper Res 169(3):1158–1175MathSciNetMATHCrossRef Hadigheh AG, Terlaky T (2006) Sensitivity analysis in linear optimization: invariant support set intervals. Eur J Oper Res 169(3):1158–1175MathSciNetMATHCrossRef
51.
Zurück zum Zitat Wimalajeewa T, Varshney PK (2017) Sparse signal detection with compressive measurements via partial support set estimation. IEEE Trans Signal Inf Process Over Netw 3(1):46–60MathSciNetCrossRef Wimalajeewa T, Varshney PK (2017) Sparse signal detection with compressive measurements via partial support set estimation. IEEE Trans Signal Inf Process Over Netw 3(1):46–60MathSciNetCrossRef
52.
Zurück zum Zitat Jiang M, Luo YP, Yang SY (2007) Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Inf Process Lett 102(1):8–16MathSciNetMATHCrossRef Jiang M, Luo YP, Yang SY (2007) Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Inf Process Lett 102(1):8–16MathSciNetMATHCrossRef
53.
Zurück zum Zitat Chih M, Lin C-J, Chern M-S, Ou T-Y (2014) Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem. Appl Math Model 38(4):1338–1350MathSciNetMATHCrossRef Chih M, Lin C-J, Chern M-S, Ou T-Y (2014) Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem. Appl Math Model 38(4):1338–1350MathSciNetMATHCrossRef
54.
Zurück zum Zitat Amir GH, Xin-She Y, Amir AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29(2):245CrossRef Amir GH, Xin-She Y, Amir AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29(2):245CrossRef
55.
Zurück zum Zitat Changping L, Chunming Y (2013) Bat algorithm with the characteristics of Lévy flights. CAAI Trans Intell Syst 8(3):240–246 Changping L, Chunming Y (2013) Bat algorithm with the characteristics of Lévy flights. CAAI Trans Intell Syst 8(3):240–246
56.
Zurück zum Zitat Jian X, Yong-Quan Z, Huan C (2013) A bat algorithm based on Lévy flights trajectory. Pattern Recognit Artif Intell 26(9):829–837 Jian X, Yong-Quan Z, Huan C (2013) A bat algorithm based on Lévy flights trajectory. Pattern Recognit Artif Intell 26(9):829–837
Metadaten
Titel
An ensemble bat algorithm for large-scale optimization
verfasst von
Xingjuan Cai
Jiangjiang Zhang
Hao Liang
Lei Wang
Qidi Wu
Publikationsdatum
26.08.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
International Journal of Machine Learning and Cybernetics / Ausgabe 11/2019
Print ISSN: 1868-8071
Elektronische ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-019-01002-8

Weitere Artikel der Ausgabe 11/2019

International Journal of Machine Learning and Cybernetics 11/2019 Zur Ausgabe

Neuer Inhalt