The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Nuclear Reaction Optimization: A Novel and Powerful Physics-Based Algorithm for Global Optimization
Open accessAbstract
Meta-heuristic algorithms have gained substantial popularity in recent decades and have focused on applications in a wide spectrum of fields. In this paper, a new and powerful physics-based algorithm named nuclear reaction optimization (NRO) is presented. Meanwhile, NRO imitates the nuclear reaction process and consists of two phases, namely, a nuclear fission (NFi) phase and a nuclear fusion (NFu) phase. The Gaussian walk and differential evolution operators between nucleus and neutron are employed for exploitation and appropriate exploration in the (NFi) phase, respectively. Meanwhile, the variants of differential evolution operator are utilized for exploration in the NFu phase, which consists of the ionization and fusion stages. Additionally, the variants of Levy flight are used for random searching to escape from the local optima in each stage of the NFu phase. The exploration and exploitation abilities of NRO can be balanced due to a combination of the two phases. Both constrained and unconstrained benchmark functions are employed for testing the performance of NRO. To make comparisons between NRO and the state-of-the-art algorithms, 23 classic benchmark functions and twenty-night modern benchmark functions are performed. Moreover, three engineering design optimization problems are solved as constrained benchmark functions by using NRO and the compared algorithms. The results illustrate that the proposed nuclear reaction optimization algorithm is a potential and powerful approach for global optimization.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
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
Cited by
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
Wang, L., Cao, Q., Zhang, Z., Mirjalili, S., & Zhao, W. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105082 · Cited by 777
Hippopotamus optimization algorithm: a novel nature-inspired optimization algorithm
Amiri, M. H., Mehrabi Hashjin, N., Montazeri, M., Mirjalili, S., & Khodadadi, N. (2024) · Scientific Reports · doi:10.1038/s41598-024-54910-3 · Cited by 718
Northern Goshawk Optimization: A New Swarm-Based Algorithm for Solving Optimization Problems
Dehghani, M., Hubalovsky, S., & Trojovsky, P. (2021) · IEEE Access · doi:10.1109/access.2021.3133286 · Cited by 574
Dehghani, M., & Trojovský, P. (2023) · Frontiers in Mechanical Engineering · doi:10.3389/fmech.2022.1126450 · Cited by 567
Metadata
- Authors
- Wei, Z., Huang, C., Wang, X., Han, T., & Li, Y.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 66084-66109
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2944829093
- Cited by
- 185
- References
- 2
- FWCI
- 5.53
- Type
- journal article
- Language
- en
- Open access
- gold
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: Nuclear Reaction Optimization: A Novel and Powerful Physics-Based Algorithm for Global Optimization. https://app.cochat.ai/papers/10.1109/access.2019.2918406
- The paper
- Wei, Z., Huang, C., Wang, X., Han, T., & Li, Y. (2019). Nuclear Reaction Optimization: A Novel and Powerful Physics-Based Algorithm for Global Optimization. IEEE Access. https://doi.org/10.1109/access.2019.2918406
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.