The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
The most used MPPT algorithms: Review and the suitable low-cost embedded board for each algorithm
Abstract
Abstract In order to increase the production of photovoltaic-based cleaner energy, the maximum power point tracking (MPPT) controller was employed. Because different MPPT algorithms have been adduced in the literature, it is mandatory to compare and differentiate them to select the most adequate MPPT for a particular application or to make suggestions for future research regarding MPPT. This paper reviews (extensively) the most used MPPT algorithms. They are classified into three groups: (1) direct, such as hill climbing (HC), perturb and observe (PO (2) indirect, namely fractional short-circuit current (FSCC), Fractional Open-Circuit Voltage (FOCV), and pilot cell and (3); soft computing methods such as a Kalman filter, fuzzy logic control (FLC), neural network, partial swarm optimization (PSO), ant colony optimization (ACO), artificial bee colony (ABC), bat algorithm and hybrid PSO-FLC. A detailed principle of operation and the merits and downsides of each method are discussed. Also, the distributed MPPT and other MPPT methods are briefly presented. Finally, a recommendation of the most well-suited embedded board for the implementation of each method is presented and discussed. To complete these objectives, this manuscript focuses solely on the low-cost embedded board.
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 new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
A New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
A Comparative Study on Maximum Power Point Tracking Techniques for Photovoltaic Power Systems
Subudhi, B., & Pradhan, R. (2013) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2012.2202294 · Cited by 1,867
Ishaque, K., Salam, Z., Amjad, M., & Mekhilef, S. (2012) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2012.2185713 · Cited by 1,100
Evolutionary many-objective optimization: A short review
Ishibuchi, H., Tsukamoto, N., & Nojima, Y. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4631121 · Cited by 914
Comparative study of maximum power point tracking algorithms
Hohm, D. P., & Ropp, M. E. (2003) · Progress in Photovoltaics: Research and Applications · doi:10.1002/pip.459 · Cited by 865
Reza Reisi, A., Hassan Moradi, M., & Jamasb, S. (2013) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2012.11.052 · Cited by 690
Ishaque, K., & Salam, Z. (2013) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2012.11.032 · Cited by 600
Solar power technologies for sustainable electricity generation – A review
Khan, J., & Arsalan, M. H. (2016) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2015.10.135 · Cited by 580
Bio inspired computing – A review of algorithms and scope of applications
Kar, A. K. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.04.018 · Cited by 578
Cited by
Yang, B., Zhu, T., Wang, J., Shu, H., Yu, T., Zhang, X., Yao, W., & Sun, L. (2020) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2020.121983 · Cited by 264
Metadata
- Authors
- Motahhir, S., El Hammoumi, A., & El Ghzizal, A.
- Venue
- Journal of Cleaner Production
- Publisher
- Elsevier BV
- Published
- 2020-02
- Volume
- 246
- Pages
- 118983
- ISSN
- 0959-6526 (ISSN-L)
- OpenAlex
- W2982196448
- Cited by
- 392
- References
- 59
- FWCI
- 8.86
- 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: The most used MPPT algorithms: Review and the suitable low-cost embedded board for each algorithm. https://app.cochat.ai/papers/10.1016/j.jclepro.2019.118983
- The paper
- Motahhir, S., El Hammoumi, A., & El Ghzizal, A. (2020). The most used MPPT algorithms: Review and the suitable low-cost embedded board for each algorithm. Journal of Cleaner Production. https://doi.org/10.1016/j.jclepro.2019.118983
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.