The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A new metaheuristic for numerical function optimization: Vortex Search 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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
On the performance of artificial bee colony (ABC) algorithm
Karaboga, D., & Basturk, B. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2007.05.007 · Cited by 3,672
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Cited by
RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method
Ahmadianfar, I., Heidari, A. A., Gandomi, A. H., Chu, X., & Chen, H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115079 · Cited by 1,115
Snake Optimizer: A novel meta-heuristic optimization algorithm
Hashim, F. A., & Hussien, A. G. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108320 · Cited by 1,106
Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications
Zhao, W., Zhang, Z., & Wang, L. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2019.103300 · Cited by 1,080
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
Golden jackal optimization: A novel nature-inspired optimizer for engineering applications
Chopra, N., & Mohsin Ansari, M. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116924 · Cited by 892
Metadata
- Authors
- Doğan, B., & Ölmez, T.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2015-02
- Volume
- 293
- Pages
- 125-145
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2088609193
- Cited by
- 397
- References
- 31
- FWCI
- 15.51
- Type
- journal article
- 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: A new metaheuristic for numerical function optimization: Vortex Search algorithm. https://app.cochat.ai/papers/10.1016/j.ins.2014.08.053
- The paper
- Doğan, B., & Ölmez, T. (2015). A new metaheuristic for numerical function optimization: Vortex Search algorithm. Information Sciences. https://doi.org/10.1016/j.ins.2014.08.053
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.