The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
New directional bat algorithm for continuous optimization problems
Open accessAbstract
Bat algorithm (BA) is a recent optimization algorithm based on swarm intelligence and inspiration from the echolocation behavior of bats. One of the issues in the standard bat algorithm is the premature convergence that can occur due to the low exploration ability of the algorithm under some conditions. To overcome this deficiency, directional echolocation is introduced to the standard bat algorithm to enhance its exploration and exploitation capabilities. In addition to such directional echolocation, three other improvements have been embedded into the standard bat algorithm to enhance its performance. The new proposed approach, namely the directional Bat Algorithm (dBA), has been then tested using several standard and non-standard benchmarks from the CEC’2005 benchmark suite. The performance of dBA has been compared with ten other algorithms and BA variants using non-parametric statistical tests. The statistical test results show the superiority of the directional bat algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
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
Cited by
Coyote optimization algorithm: A new metaheuristic for global optimization problems
Pierezan, J., & Dos Santos Coelho, L. (2018) · 2018 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2018.8477769 · Cited by 645
Nature-inspired optimization algorithms: Challenges and open problems
Yang, X.-S. (2020) · Journal of Computational Science · doi:10.1016/j.jocs.2020.101104 · Cited by 429
Self-citationFarmland fertility: A new metaheuristic algorithm for solving continuous optimization problems
Shayanfar, H., & Gharehchopogh, F. S. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.07.033 · Cited by 347
An exploration-enhanced grey wolf optimizer to solve high-dimensional numerical optimization
Long, W., Jiao, J., Liang, X., & Tang, M. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.10.024 · Cited by 290
Yang, X.-S. (2021) · Nature-Inspired Optimization Algorithms · doi:10.1016/b978-0-12-821986-7.00018-4 · Cited by 73
Self-citation
Metadata
- Authors
- Chakri, A., Khelif, R., Benouaret, M., & Yang, X.-S.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2017-03
- Volume
- 69
- Pages
- 159-175
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2535324361
- Cited by
- 237
- References
- 2
- FWCI
- 24.34
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: New directional bat algorithm for continuous optimization problems. https://app.cochat.ai/papers/10.1016/j.eswa.2016.10.050
- The paper
- Chakri, A., Khelif, R., Benouaret, M., & Yang, X.-S. (2017). New directional bat algorithm for continuous optimization problems. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2016.10.050
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.