The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Improving the local search capability of Effective Butterfly Optimizer using Covariance Matrix Adapted Retreat Phase
Abstract
Effective Butterfly Optimizer(EBO) is a self-adaptive Butterfly Optimizer which incorporates a crossover operator in Perching and Patrolling to increase the diversity of the population. This paper proposes a new retreat phase called Covariance Matrix Adapted Retreat Phase (CMAR), which uses covariance matrix to generate a new solution and thus improves the local search capability of EBO. This version of EBO is called EBOwithCMAR. We evaluated the performance of EBOwithCMAR on CEC-2017 benchmark problems and compared with the results of winners of a special session of CEC-2016 for bound-constrained problems. The experimental results show that EBOwithCMAR is competitive with the compared algorithms.
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
Hansen, N., Müller, S. D., & Koumoutsakos, P. (2003) · Evolutionary Computation · doi:10.1162/106365603321828970 · Cited by 2,601
Cited by
Heap-based optimizer inspired by corporate rank hierarchy for global optimization
Askari, Q., Saeed, M., & Younas, I. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113702 · Cited by 380
Chen, H., Heidari, A. A., Chen, H., Wang, M., Pan, Z., & Gandomi, A. H. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.04.008 · Cited by 322
Metadata
- Authors
- Kumar, A., Misra, R. K., & Singh, D.
- Venue
- 2017 IEEE Congress on Evolutionary Computation (CEC)
- Publisher
- IEEE
- Published
- 2017-06
- Pages
- 1835-1842
- OpenAlex
- W2730253853
- Cited by
- 241
- References
- 1
- FWCI
- 6.99
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Improving the local search capability of Effective Butterfly Optimizer using Covariance Matrix Adapted Retreat Phase. https://app.cochat.ai/papers/10.1109/cec.2017.7969524
- The paper
- Kumar, A., Misra, R. K., & Singh, D. (2017). Improving the local search capability of Effective Butterfly Optimizer using Covariance Matrix Adapted Retreat Phase. 2017 IEEE Congress on Evolutionary Computation (CEC). https://doi.org/10.1109/cec.2017.7969524
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.