Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 471

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

BAS: Beetle Antennae Search Algorithm for Optimization Problems

Open access
Jiang, Xiangyuan, Li, Shuai·2018·International Journal of Robotics and Control

Abstract

Meta-heuristic algorithms have become very popular because of powerful performance on the optimization problem. A new algorithm called beetle antennae search algorithm (BAS) is proposed in the paper inspired by the searching behavior of long-horn beetles. The BAS algorithm imitates the function of antennae and the random walking mechanism of beetles in nature, and then two main steps of detecting and searching are implemented. Finally, the algorithm is benchmarked on 2 well-known test functions, in which the numerical results validate the efficacy of the proposed BAS 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.5430/ijrc.v1n1p1

Cites

8 of 8 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 8 references

Cited by

See all 471

Metadata

Authors
Jiang, X., & Li, S.
Venue
International Journal of Robotics and Control
Publisher
Sciedu Press
Published
2018-04-25
Volume
1
Issue
1
Pages
1
ISSN
  • 2577-7742 (ISSN-L)
  • 2577-7769
OpenAlex
W2964247400
Cited by
471
References
8
FWCI
30.55
Type
journal article
Language
en
Open access
diamond

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: BAS: Beetle Antennae Search Algorithm for Optimization Problems. https://app.cochat.ai/papers/10.5430/ijrc.v1n1p1
The paper
Jiang, X., & Li, S. (2018). BAS: Beetle Antennae Search Algorithm for Optimization Problems. International Journal of Robotics and Control. https://doi.org/10.5430/ijrc.v1n1p1

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.