The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
A Novel Hybrid Bat Algorithm with Harmony Search for Global Numerical Optimization
Open accessAbstract
A novel robust hybrid metaheuristic optimization approach, which can be considered as an improvement of the recently developed bat algorithm, is proposed to solve global numerical optimization problems. The improvement includes the addition of pitch adjustment operation in HS serving as a mutation operator during the process of the bat updating with the aim of speeding up convergence, thus making the approach more feasible for a wider range of real-world applications. The detailed implementation procedure for this improved metaheuristic method is also described. Fourteen standard benchmark functions are applied to verify the effects of these improvements, and it is demonstrated that, in most situations, the performance of this hybrid metaheuristic method (HS/BA) is superior to, or at least highly competitive with, the standard BA and other population-based optimization methods, such as ACO, BA, BBO, DE, ES, GA, HS, PSO, and SGA. The effect of the HS/BA parameters is also analyzed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
A New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
Derrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
Nature-Inspired Metaheuristic Algorithms
Yang, X. (2008) · Medical Entomology and Zoology · Cited by 4,556
Biogeography-Based Optimization
Simon, D. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.919004 · Cited by 4,305
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
Friedman, M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731944 · Cited by 2,785
(2005) · Cited by 2,565
Bat algorithm: a novel approach for global engineering optimization
Yang, X., & Hossein Gandomi, A. (2012) · Engineering Computations · doi:10.1108/02644401211235834 · Cited by 1,751
Törn, A., & Žilinskas, A. (1989) · Cited by 1,673
Bat algorithm: a novel approach for global engineering optimization
Yang, X., & Gandomi, A. H. (2012) · Middlesex University Research Repository (Middlesex University Of London) · Cited by 1,057
The Theory of Evolution Strategies
Beyer, H.-G. (2001) · Natural Computing Series · doi:10.1007/978-3-662-04378-3 · Cited by 878
Tang, K., Yao, X., Suganthan, P. N., MacNish, C., Chen, Y. P., Chen, C. M., & Yang, Z. (2008) · Cited by 656
Islam, S. M., Das, S., Ghosh, S., Roy, S., & Suganthan, P. N. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2167966 · Cited by 604
Bat algorithm for constrained optimization tasks
Gandomi, A. H., Yang, X., Alavi, A. H., & Talatahari, S. (2012) · Neural Computing and Applications · doi:10.1007/s00521-012-1028-9 · Cited by 548
Mallipeddi, R., & Suganthan, P. N. (2010) · Cited by 524
New inspirations in swarm intelligence: a survey
Parpinelli, R. S., & Lopes, H. S. (2011) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2011.038700 · Cited by 402
Chaos-enhanced accelerated particle swarm optimization
Gandomi, A. H., Yun, G. J., Yang, X.-S., & Talatahari, S. (2013) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2012.07.017 · Cited by 396
Generalized descent for global optimization
Griewank, A. (1981) · Journal of Optimization Theory and Applications · doi:10.1007/bf00933356 · Cited by 381
A self-adaptive global best harmony search algorithm for continuous optimization problems
Pan, Q.-K., Suganthan, P. N., Tasgetiren, M. F., & Liang, J. J. (2010) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.01.088 · Cited by 375
Gong, W., Cai, Z., & Ling, C. X. (2010) · Soft Computing · doi:10.1007/s00500-010-0591-1 · Cited by 369
Locating multiple optima using particle swarm optimization
Brits, R., Engelbrecht, A. P., & van den Bergh, F. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.12.066 · Cited by 229
Incorporating mutation scheme into krill herd algorithm for global numerical optimization
Wang, G., Guo, L., Wang, H., Duan, H., Liu, L., & Li, J. (2014) · Neural Computing and Applications · doi:10.1007/s00521-012-1304-8 · Cited by 209
Self-citationAn empirical study of bit vector function optimization
Ackley, D. H. (1987) · Medical Entomology and Zoology · Cited by 162
Bat Algorithm Inspired Algorithm for Solving Numerical Optimization Problems
Tsai, P. W., Pan, J. S., Liao, B. Y., Tsai, M. J., & Istanda, V. (2011) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.148-149.134 · Cited by 161
Dynamic multi-swarm particle swarm optimizer with harmony search
Zhao, S.-Z., Suganthan, P. N., Pan, Q.-K., & Tasgetiren, M. F. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.09.032 · Cited by 119
Cited by
SCA: A Sine Cosine Algorithm for solving optimization problems
Mirjalili, S. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.12.022 · Cited by 5,696
Bat algorithm: literature review and applications
Yang, X. S., & He, X. (2013) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2013.055093 · Cited by 1,052
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Nature-Inspired Optimization Algorithms
(2021) · Elsevier eBooks · doi:10.1016/c2019-0-03762-4 · Cited by 755
Wang, G.-G., Guo, L., Gandomi, A. H., Hao, G.-S., & Wang, H. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.123 · Cited by 564
Self-citation
Metadata
- Authors
- Wang, G., & Guo, L.
- Venue
- Journal of Applied Mathematics
- Publisher
- Wiley
- Published
- 2013
- Volume
- 2013
- Pages
- 1-21
- ISSN
- 1110-757X (ISSN-L)
- 1687-0042
- OpenAlex
- W2060986680
- Cited by
- 296
- References
- 35
- FWCI
- 33.87
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.