An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
In this review paper, JAYA algorithm, which is a recent population-based algorithm is intensively overviewed. The JAYA algorithm combines the survival of the fittest principle from evolutionary algorithms as well as the global optimal solution attractions of Swarm Intelligence methods. Initially, the optimization model and convergence characteristics of JAYA algorithm are carefully analyzed. Thereafter, the proposed versions of JAYA algorithm have been surveyed such as modified, binary, hybridized, parallel, chaotic, multi-objective and others. The various applications tackled using relevant versions of JAYA algorithm are also discussed and summarized based on several problem domains. Furthermore, the open sources code of JAYA algorithm are identified to provide enrich resources for JAYA research communities. The critical analysis of JAYA algorithm reveals its advantages and limitations in dealing with optimization problems. Finally, the paper ends up with conclusion and possible future enhancements suggested to improve the performance of JAYA algorithm. The reader of this overview will determine the best domains and applications used by JAYA algorithm and can justify their JAYA-related contributions.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569 · cited 1×
“Other EAs includes: Genetic Algorithm (GA) [7], Differential evolution (DE) [8], Evolutionary programming (EP) [9], Evolution strategies (ES) [10], Genetic Programming (GP) [11], Probability-based incremental learning (PBIL) [12], and Biogeography-Based Optimizer (BBO) [13].”
BackgroundParticle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001 · cited 1×
“The most popular local search algorithms are 𝛽 -Hill Climbing [14], Simulated Annealing[15], Tabu Search [16], Iterated Local Search [17], Variable Neighborhood Search [18], and Greedy Randomized Adaptive Search Procedure (GRASP) [19].”
Method
Cited by
Hussain, Z. F., & Ibraheem, H. R. (2023) · Mesopotamian Journal of CyberSecurity · doi:10.58496/mjcs/2023/007 · Cited by 18
Metadata
- Authors
- Zitar, R. A., Al-Betar, M. A., Awadallah, M. A., Doush, I. A., & Assaleh, K.
- Venue
- Archives of Computational Methods in Engineering
- Published
- 2021-05-27
- Volume
- 29
- Issue
- 2
- Pages
- 763-792
- ISSN
- 1134-3060 (ISSN-L)
- 1886-1784
- OpenAlex
- W3164172623
- Cited by
- 216
- References
- 5
- FWCI
- 12.53
- Type
- journal article
- Language
- en
- Open access
- bronze
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: An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications. https://app.cochat.ai/papers/10.1007/s11831-021-09585-8
- The paper
- Zitar, R. A., Al-Betar, M. A., Awadallah, M. A., Doush, I. A., & Assaleh, K. (2022). An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications. Archives of Computational Methods in Engineering. https://doi.org/10.1007/s11831-021-09585-8
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.