The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Optimal power flow using moth swarm 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
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
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm
Mirjalili, S. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.07.006 · Cited by 4,626
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
13 Flower Pollination Algorithm for Global OptimizationPreprint
Yang, X. (2012) · Cited by 2,272
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
Optimal Load Flow with Steady-State Security
Alsac, O., & Stott, B. (1974) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1974.293972 · Cited by 1,557
A study of particle swarm optimization particle trajectories
VANDENBERGH, F., & ENGELBRECHT, A. (2006) · Information Sciences · doi:10.1016/j.ins.2005.02.003 · Cited by 1,397
Rajabioun, R. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2011.05.008 · Cited by 1,148
The ecological impacts of nighttime light pollution: a mechanistic appraisal
Gaston, K. J., Bennie, J., Davies, T. W., & Hopkins, J. (2013) · Biological Reviews · doi:10.1111/brv.12036 · Cited by 1,110
Fast, accurate algorithm for numerical simulation of Lévy stable stochastic processes
Mantegna, R. N. (1994) · Physical Review E · doi:10.1103/physreve.49.4677 · Cited by 856
Cited by
An improved grey wolf optimizer for solving engineering problems
Nadimi-Shahraki, M. H., Taghian, S., & Mirjalili, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113917 · Cited by 1,153
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
Atom search optimization and its application to solve a hydrogeologic parameter estimation problem
Zhao, W., Wang, L., & Zhang, Z. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.08.030 · Cited by 699
Dandelion Optimizer: A nature-inspired metaheuristic algorithm for engineering applications
Zhao, S., Zhang, T., Ma, S., & Chen, M. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105075 · Cited by 492
Moth–flame optimization algorithm: variants and applications
Shehab, M., Abualigah, L., Al Hamad, H., Alabool, H., Alshinwan, M., & Khasawneh, A. M. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04570-6 · Cited by 316
Metadata
- Authors
- Mohamed, A.-A. A., Mohamed, Y. S., El-Gaafary, A. A. M., & Hemeida, A. M.
- Venue
- Electric Power Systems Research
- Publisher
- Elsevier BV
- Published
- 2017-01
- Volume
- 142
- Pages
- 190-206
- ISSN
- 0378-7796 (ISSN-L)
- OpenAlex
- W2528180509
- Cited by
- 501
- References
- 28
- FWCI
- 19.06
- 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: Optimal power flow using moth swarm algorithm. https://app.cochat.ai/papers/10.1016/j.epsr.2016.09.025
- The paper
- Mohamed, A.-A. A., Mohamed, Y. S., El-Gaafary, A. A. M., & Hemeida, A. M. (2017). Optimal power flow using moth swarm algorithm. Electric Power Systems Research. https://doi.org/10.1016/j.epsr.2016.09.025
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.