The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems
Open accessAbstract
A simple yet powerful optimization algorithm is proposed in this paper for solving the constrained and unconstrained optimization problems.This algorithm is based on the concept that the solution obtained for a given problem should move towards the best solution and should avoid the worst solution.This algorithm requires only the common control parameters and does not require any algorithm-specific control parameters.The performance of the proposed algorithm is investigated by implementing it on 24 constrained benchmark functions having different characteristics given in Congress on Evolutionary Computation (CEC 2006) and the performance is compared with that of other well-known optimization algorithms.The results have proved the better effectiveness of the proposed algorithm.Furthermore, the statistical analysis of the experimental work has been carried out by conducting the Friedman's rank test and Holm-Sidak test.The proposed algorithm is found to secure first rank for the 'best' and 'mean' solutions in the Friedman's rank test for all the 24 constrained benchmark problems.In addition to solving the constrained benchmark problems, the algorithm is also investigated on 30 unconstrained benchmark problems taken from the literature and the performance of the algorithm is found better.
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 Simple Sequentially Rejective Multiple Test Procedure
(1979) · Scandinavian Journal of Statistics · doi:10.2307/4615733 · Cited by 21,526
Derrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512
Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2011) · Computer-Aided Design · doi:10.1016/j.cad.2010.12.015 · Cited by 5,150
A comparative study of Artificial Bee Colony algorithm
Karaboga, D., & Akay, B. (2009) · Applied Mathematics and Computation · doi:10.1016/j.amc.2009.03.090 · Cited by 3,206
(2005) · Cited by 2,565
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
Karaboga, D., & Basturk, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72950-1_77 · Cited by 1,407
A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems
Karaboğa, D., & Akay, B. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2010.12.001 · Cited by 597
Rao, R. V., & Patel, V. K. (2012) · International Journal of Industrial Engineering Computations · doi:10.5267/j.ijiec.2012.03.007 · Cited by 511
Liang, J., Rúnarsson, T. P., Mezura‐Montes, E., Clerc, M., Suganthan, P. N., Coello, C. A. C., & Deb, K. (2006) · Cited by 422
Heat transfer search (HTS): a novel optimization algorithm
Patel, V. K., & Savsani, V. J. (2015) · Information Sciences · doi:10.1016/j.ins.2015.06.044 · Cited by 263
Cited by
RIME: A physics-based optimization
Su, H., Zhao, D., Heidari, A. A., Liu, L., Zhang, X., Mafarja, M., & Chen, H. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.02.010 · Cited by 1,074
Metaheuristic Algorithms on Feature Selection: A Survey of One Decade of Research (2009-2019)
Agrawal, P., Abutarboush, H. F., Ganesh, T., & Mohamed, A. W. (2021) · IEEE Access · doi:10.1109/access.2021.3056407 · Cited by 613
Metaheuristic algorithms for PID controller parameters tuning: review, approaches and open problems
Joseph, S. B., Dada, E. G., Abidemi, A., Oyewola, D. O., & Khammas, B. M. (2022) · Heliyon · doi:10.1016/j.heliyon.2022.e09399 · Cited by 458
Chaotic grey wolf optimization algorithm for constrained optimization problems
Kohli, M., & Arora, S. (2018) · Journal of Computational Design and Engineering · doi:10.1016/j.jcde.2017.02.005 · Cited by 431
Atomic orbital search: A novel metaheuristic algorithm
Azizi, M. (2021) · Applied Mathematical Modelling · doi:10.1016/j.apm.2020.12.021 · Cited by 300
Metadata
- Authors
- Venkata Rao, R.
- Venue
- International Journal of Industrial Engineering Computations
- Publisher
- Growing Science
- Published
- 2016
- Pages
- 19-34
- ISSN
- 1923-2926 (ISSN-L)
- 1923-2934
- OpenAlex
- W1698059316
- Cited by
- 2,071
- References
- 10
- FWCI
- 82.27
- 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: Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. https://app.cochat.ai/papers/10.5267/j.ijiec.2015.8.004
- The paper
- Venkata Rao, R. (2016). Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. International Journal of Industrial Engineering Computations. https://doi.org/10.5267/j.ijiec.2015.8.004
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.