2019
DOI: 10.3390/sym11070925
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Bat Algorithm Based on Lévy Flights and Adjustment Factors

Abstract: This paper proposed an improved bat algorithm based on Lévy flights and adjustment factors (LAFBA). Dynamically decreasing inertia weight is added to the velocity update, which effectively balances the global and local search of the algorithm; the search strategy of Lévy flight is added to the position update, so that the algorithm maintains a good population diversity and the global search ability is improved; and the speed adjustment factor is added, which effectively improves the speed and accuracy of the a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
29
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(31 citation statements)
references
References 51 publications
0
29
0
Order By: Relevance
“…However, the performance of the multitask network is sensitive to the weights, , of task-specific losses. Generally, previous methods tuning weights of task-specific losses are usually grid search and heuristic technologies [ 26 , 33 ]. These kind of methods are extremely time consuming, which often take many days to complete a training trial.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the performance of the multitask network is sensitive to the weights, , of task-specific losses. Generally, previous methods tuning weights of task-specific losses are usually grid search and heuristic technologies [ 26 , 33 ]. These kind of methods are extremely time consuming, which often take many days to complete a training trial.…”
Section: Methodsmentioning
confidence: 99%
“…However, the BP estimation performance of the proposed multitask is sensitive to the importance of task-specific losses. Traditionally, the optimal task-specific importance is searched by a grid search method or intelligent heuristic method [ 26 ]. However, both of them are time-consuming and high computing complexity.…”
Section: Introductionmentioning
confidence: 99%
“…In this section, to verify the searching performance of the SANGHS algorithm further, we used the SANGHS algorithm to solve two benchmark engineering problems and compared the experimental results with previous references [26][27][28][29][30][31][32][33][34][35][36][37][38].…”
Section: Two Benchmarks' Engineering Optimization Problemsmentioning
confidence: 99%
“…LAFBA [36] 0.18470619 3.64265569 9.13489736 0.20525405 1.72870000 GA1 [37] 0.24890000 6.17300000 8.17890000 0.25330000 2.43116000 RANDOM [38] 0.45750000 4.73130000 5.08530000 0.66000000 4.11855504 DAVID [38] 0.24340000 6.25520000 8.29150000 0.24440000 2.38410685 SIMPLEX [38] 0.27920000 5.62560000 7.75120000 0.27960000 2.53072583 APPOX [38] 0 Acknowledgments: The authors would like to thank all the reviewers for their constructive comments.…”
mentioning
confidence: 99%
“…Previously, several naturally or bio-inspired solutions are proposed to solve this critical issue and to improve the MPPT method for partial shading or inhomogeneous irradiation conditions [20][21][22][23][24][25][26][27][28][29][30][31][32][33]. In more detail, research concentrates on various approaches such as bio-inspired algorithms [20], particle swarm optimization (PSO) algorithms [21][22][23][24], grey wolf optimization (GWO) technique [25], and simulated annealing (SA) based method [26]. Interestingly, one can obtain better results using hybrid evolutionary algorithms based on a combination of two or more different techniques.…”
Section: Introductionmentioning
confidence: 99%