Skip to main content

Advertisement

Log in

An efficient orthogonal opposition-based learning slime mould algorithm for maximum power point tracking

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

The slime mould algorithm (SMA) is a recent physics-based optimization approach. The main inspiration of the SMA is motivated by the natural oscillating state of the slime mould organisms. In order to boost the performance, several problems must be resolved properly on the original SMA itself. One of these problems is the dilemma of the improper balancing between the exploration and exploitation phases which might deviate the algorithm to be trapped in the local optima. This work introduces a new version of the SMA called mSMA-based on the hybridization of the original SMA with a modified version of the opposition-based learning (mOBL) and the Orthogonal learning (OL) strategies. To assess the performance of the proposed mSMA, it has been evaluated over ten CEC’2020 test suites and three engineering design problems. As the output performance of the thermoelectric generator (TEG) is mainly based on the applied temperatures on the hot and cold sides of the TEG together with the load value. Consequently, in case of either varying the applied temperature or the load, to force the TEG to operate as close as possible to the maximum power point (MPP), a robust maximum power point tracking (MPPT) strategy is highly required. Therefore, an optimized fractional-order (FO) MPPTS is proposed to increase the delivered energy from the TEG. The suggested strategy is based on the FO control approach. The optimal parameters of the optimized fractional MPPTS were identified by the new mSMA. To demonstrate the superiority of mSMA, the results are compared to other well-known algorithms such as the ABC, GSA, PSO, HHO, TSA, GBO, HBO, and the original SMA. The main purpose of the proposed optimal fractional MPPTS is to increase the dynamic response and to remove the oscillations that occurred at the steady-state response. Therefore, the performance of the proposed strategy is compared to two common methods; the incremental resistance and the perturb & observe. The obtained results proved the superiority of the optimized fractional MPPTS in comparison to the other traditional MPPT methods in both the dynamic and steady-state responses.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Simpson Angus R, Dandy Graeme C, Murphy Laurence J (1994) Genetic algorithms compared to other techniques for pipe optimization. J Water Resour Plan Manag 120(4):423–443

    Google Scholar 

  2. Ilhem B, Julien L, Patrick S (2013) A survey on optimization metaheuristics. Inf Sci 237:82–117

    MathSciNet  MATH  Google Scholar 

  3. Zakeri Ehsan, Seyed Alireza Moezi, Bazargan-Lari Yousef, Zare Amin (2017) Multi-tracker optimization algorithm: a general algorithm for solving engineering optimization problems. Iran J Sci Technol Trans Mech Eng 41(4):315–341

    Google Scholar 

  4. Hashim Fatma A, Houssein Essam H, Mabrouk Mai S, Al-Atabany Walid, Mirjalili Seyedali (2019) Henry gas solubility optimization: a novel physics-based algorithm. Future Gener Comput Syst 101:646–667

    Google Scholar 

  5. Hashim Fatma A, Kashif H, Houssein Essam H, Mabrouk Mai S, Walid AA (2021) Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems. Appl Intell 51(3):1531–1551

    MATH  Google Scholar 

  6. Houssein Essam H, El-din HB, Hegazy R, Nassef Ahmed M (2021) An enhanced archimedes optimization algorithm based on local escaping operator and orthogonal learning for pem fuel cell parameter identification. Eng Appl Artif Intell 103:104309

    Google Scholar 

  7. Seyedali M, Mohammad MS, Abdolreza H (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495–513

    Google Scholar 

  8. El-Fergany Attia A (2018) Extracting optimal parameters of pem fuel cells using salp swarm optimizer. Renew Energy 119:641–648

    Google Scholar 

  9. Korashy A, Kamel S, Houssein EH, Jurado F, Hashim FA (2021) Development and application of evaporation rate water cycle algorithm for optimal coordination of directional overcurrent relays. Exp Syst Appl 185:115538

    Google Scholar 

  10. Hassan MH, Houssein EH, Mahdy MA, Salah K (2021) An improved manta ray foraging optimizer for cost-effective emission dispatch problems. Eng Appl Artif Intell 100:104155

    Google Scholar 

  11. Houssein EH, Nageh ZG, Diab AAZ, Younis EMG (2021) An efficient manta ray foraging optimization algorithm for parameter extraction of three-diode photovoltaic model. Comput Electr Eng 94:107304

    Google Scholar 

  12. Abbassi Rabeh, Abbassi Abdelkader, Ali Asghar Heidari, Mirjalili Seyedali (2019) An efficient salp swarm-inspired algorithm for parameters identification of photovoltaic cell models. Energy Convers Manag 179:362–372

    Google Scholar 

  13. Houssein EH, Helmy BE, Oliva D, Elngar AA, Shaban H (2021) Multi-level thresholding image segmentation based on nature-inspired optimization algorithms: a comprehensive review. Metaheurist Mach Learn Theory Appl 967:239–265

    Google Scholar 

  14. Kalyanmoy D (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, London

    MATH  Google Scholar 

  15. Holland John H (1992) Genetic algorithms. Scient Am 267(1):66–73

    Google Scholar 

  16. Rainer S, Kenneth P (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Opt 11(4):341–359

    MathSciNet  MATH  Google Scholar 

  17. Eberhart RC, Shi Y (1998) Comparison between genetic algorithms and particle swarm optimization. In: international conference on evolutionary programming. Springer, pp. 611–616

  18. Dawid P, Marcin W (2021) Red fox optimization algorithm. Exp Syst Appl 166:114107

    Google Scholar 

  19. Połap Dawid et al (2017) Polar bear optimization algorithm: meta-heuristic with fast population movement and dynamic birth and death mechanism. Symmetry 9(10):203

    Google Scholar 

  20. Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: a new method for stochastic optimization. Future Gener Comput Syst 111:300–323

    Google Scholar 

  21. Esmat R, Hossein NP, Saeid S (2009) Gsa: a gravitational search algorithm. Inf Sci 179(13):2232–2248

    MATH  Google Scholar 

  22. Wolpert David H, Macready William G (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67–82

    Google Scholar 

  23. Ibrahim Mohamed N, Hegazy R, Mujahed AD, Peter S (2019) Hybrid photovoltaic-thermoelectric generator powered synchronous reluctance motor for pumping applications. IEEE Access 7:146979–146988

    Google Scholar 

  24. Wei-Hsin C, Yi-Xian L (2019) Performance comparison of thermoelectric generators using different materials. Energy Procedia 158:1388–1393

    Google Scholar 

  25. Hegazy R, Eltamaly Ali M (2015) A comprehensive comparison of different mppt techniques for photovoltaic systems. Solar Energy 112:1–11

    Google Scholar 

  26. Hegazy R, Ahmed F (2020) Performance improvement of pem fuel cell using variable step-size incremental resistance mppt technique. Sustainability 12(14):5601

    Google Scholar 

  27. Kanagaraj N, Hegazy R, Gomaa MR (2020) A variable fractional order fuzzy logic control-based mppt technique for improving energy conversion efficiency of thermoelectric power generator. Energies 13(17):4531

    Google Scholar 

  28. Roy Prasanta, Binoy Krishna Roy (2016) Fractional order pi control applied to level control in coupled two tank mimo system with experimental validation. Control Eng Practice 48:119–135

    Google Scholar 

  29. Ewees Ahmed A, Elaziz Mohamed Abd, Houssein Essam H (2018) Improved grasshopper optimization algorithm using opposition-based learning. Exp Syst Appl 112:156–172

    Google Scholar 

  30. Tizhoosh HR (2005) opposition-based learning: a new scheme for machine intelligence. In: international conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC’06), vol 1. IEEE, pp 695–701

  31. Tubishat Mohammad, Idris Norisma, Shuib Liyana, Abushariah Mohammad AM, Mirjalili Seyedali (2020) Improved salp swarm algorithm based on opposition based learning and novel local search algorithm for feature selection. Exp Syst Appl 145:113122

    Google Scholar 

  32. Liu Y, Cao B, Li H (2020) Improving ant colony optimization algorithm with epsilon greedy and levy flight. Complex Intell Syst 7(4):1711–1722

    Google Scholar 

  33. Mantegna RN (1994) Fast, accurate algorithm for numerical simulation of levy stable stochastic processes. Phys Rev E 49(5):4677

    Google Scholar 

  34. Liang X, Cai Z, Wang M, Zhao X, Chen H, Li C (2020) Chaotic oppositional sine-cosine method for solving global optimization problems. Eng Comput. https://doi.org/10.1007/s00366-020-01083-y

    Article  Google Scholar 

  35. Shubham G, Kusum D (2020) A memory-based grey wolf optimizer for global optimization tasks. Appl Soft Comput 93:106367

    Google Scholar 

  36. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report, Technical report-tr06, Erciyes university, engineering faculty, computer

  37. Eberhart R, Kennedy J (1995) Particle swarm optimization. In: proceedings of the IEEE international conference on neural networks, vol 4. Citeseer, pp 1942–1948

  38. Asghar HA, Seyedali M, Hossam F, Ibrahim A, Majdi M, Huiling C (2019) Harris hawks optimization: algorithm and applications. Future Gener Comput Syst 97:849–872

    Google Scholar 

  39. Kaur S, Awasthi Lalit K, Sangal AL, Dhiman G (2020) Tunicate swarm algorithm: a new bio-inspired based metaheuristic paradigm for global optimization. Eng Appl Artif Intell 90:103541

    Google Scholar 

  40. Askari Q, Saeed M, Younas I (2020) Heap-based optimizer inspired by corporate rank hierarchy for global optimization. Exp Syst Appl 161:113702

    Google Scholar 

  41. Ahmadianfar I, Bozorg-Haddad O, Chu X (2020) Gradient-based optimizer: a new metaheuristic optimization algorithm. Inf Sci 540:131–159

    MathSciNet  MATH  Google Scholar 

  42. Mohamed AW, Hadi AA, Mohamed AK, Awad NH (2020) Evaluating the performance of adaptive gainingsharing knowledge-based algorithm on cec 2020 benchmark problems. In: 2020 IEEE congress on evolutionary computation (CEC). IEEE, pp. 1–8

  43. van Doorn J, Ly A, Marsman M, Wagenmakers E-J (2020) Bayesian rank-based hypothesis testing for the rank sum test, the signed rank test, and spearman’s \(\rho \). J Appl Stat 47(16):2984–3006

    MathSciNet  Google Scholar 

  44. Dhiman G, Kumar V (2017) Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications. Adv Eng Softw 114:48–70

    Google Scholar 

  45. Chakraborty I, Kumar V, Nair Shivashankar B, Tiwari R (2003) Rolling element bearing design through genetic algorithms. Eng Optim 35(6):649–659

    Google Scholar 

  46. Rezk H, Ziad MA, Abdalla O, Younis O, Mohamed RG, Hashim M (2019) Hybrid moth-flame optimization algorithm and incremental conductance for tracking maximum power of solar pv/thermoelectric system under different conditions. Mathematics 7(10):875

    Google Scholar 

  47. Yang B, Zhang M, Zhang X, Wang J, Shu H, Li S, He T, Yang L, Tao Y (2020) Fast atom search optimization based mppt design of centralized thermoelectric generation system under heterogeneous temperature difference. J Clean Prod 248:119301

    Google Scholar 

  48. Al-Dhaifallah M, Nassef Ahmed M, Rezk H, Kottakkaran SN (2018) Optimal parameter design of fractional order control based inc-mppt for pv system. Solar Energy 159:650–664

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Contributions

EHH: Supervision, Methodology, Conceptualization, Software, Formal analysis, Writing - review & editing. BE-dH: Resources, Writing - original draft. HR: Conceptualization, Software, Formal analysis, Writing - review & editing. AMN: Methodology, Software, Formal analysis, Writing - review & editing. All authors read and approved the final paper.

Corresponding author

Correspondence to Essam H. Houssein.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interest. The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix A: tension/compression spring design problem

The mathematical model of the Tension/compression spring design problem is as follows:

$$\begin{aligned}&\mathbf {x}=\left[ {{x}_{1}}\,{{x}_{2}}\,{{x}_{3}} \right] =\left[ d\,D\,N \right] \\&\text {Minimize } f\left( {\mathbf {x}} \right) =\left( {{x}_{3}}+2 \right) {{x}_{2}}x_{1}^{2} \\&\text {subject to: } \\&{{g}_{1}}\left( {\mathbf {x}} \right) =1-\frac{x_{2}^{3}{{x}_{3}}}{71785x_{1}^{4}}\le 0 \\&{{g}_{2}}\left( {\mathbf {x}} \right) =\frac{4x_{2}^{2}-{{x}_{1}}{{x}_{2}}}{12566\left( {{x}_{2}}x_{1}^{3}-x_{1}^{4} \right) }+\frac{1}{5108x_{1}^{2}}-1\le 0 \\&{{g}_{3}}\left( {\mathbf {x}} \right) =1-\frac{140.45{{x}_{1}}}{x_{2}^{2}{{x}_{3}}}\le 0 \\&{{g}_{4}}\left( {\mathbf {x}} \right) =\frac{{{x}_{1}}+{{x}_{2}}}{1.5}-1\le 0 \\&\text {with } 0.05\le {{x}_{1}}\le 2.0,0.25\le {{x}_{2}}\le 1.3\,\,\, \text {and}, \,2.0\le {{x}_{3}}\le 15.0 \\ \end{aligned}$$

Appendix B: pressure vessel design problem

The mathematical model of the pressure vessel design problem is as follows:

$$\begin{aligned}&\text {Minimize }f(x)=0.6224{{x}_{1}}{{x}_{3}}{{x}_{4}}+1.7781{{x}_{2}} x_{3}^{2}+3.1661x_{1}^{2}{{x}_{4}}+19.84x_{1}^{2}{{x}_{3}} \\&\text {Subject to: }\\&{{g}_{1}}(x)=-{{x}_{1}}+0.0193x \\&{{g}_{2}}(x)=-{{x}_{2}}+0.00954{{x}_{3}}\,\le 0 \\&{{g}_{3}}(x)=-\pi x_{3}^{2}{{x}_{4}}-(4/3)\pi x_{3}^{3}+1,296,000\le 0 \\&{{g}_{4}}(x)={{x}_{4}}-240\le 0 \\&0\le {{x}_{i}}\le 100,\,\,i=1,2 \\&10\le {{x}_{i}}\le 200,\,\,i=3,4 \\ \end{aligned}$$

Appendix C: rolling element bearing design problem

The mathematical model of the rolling element bearing design problem is as follows:

$$\begin{aligned}&\text {Maximum}[C_d(X)]={\left\{ \begin{array}{ll}max(-f_cz^{2/3}D_b^{1.8}) &{} if D_b =\le 25.5\,\text{mm} \\ max(-3.647f_cz^{2/3}D_b^{1.4}) &{} if D_b =\le 25.5\,\text{mm} \end{array}\right. } \\&\text {Subject to: }\\&g_1(x)=\frac{\phi _0}{2\sin ^{-1}(D_b/D_m)}-Z+1\ge 0, \\&g_2(x)=2D_b-K_{D_{min}}(D-d)\ge 0,\\&g_3(x)=K_{D_{max}}(D-d)-2D_b\ge 0,\\&g_4(x)=\zeta B_w-D_b\ge 0,\\&g_5(x)=D_m-0.5(D+d)\ge 0,\\&g_6(x)=(0.5+e)(D+d)-D_m\ge 0,\\&g_7(x)=0.5(D-D_m-D_b)-\zeta D_b\ge 0,\\&g_8(x)=f_1\ge 0.515,\\&g_9(x)=f_0\ge 0.515,\\&where \\&f_c=37.91\left[ 1+\left[ 1.04\left( \frac{1-\gamma }{1+\gamma }\right) ^{1.72}\right] \left( \frac{f_i(2f_0-1)}{f_i-1}\right) ^{0.41}]^{10/3}\right] ^{-0.3},\\&\gamma = \frac{D_b\cos \alpha }{D_m},\\&f_1=\frac{r_1}{D_b}\\&\phi _0=2\pi -20\cos ^{-1}\left[ \frac{(D-d)/2-3(T/4)^2+[D/2-(T/4-D_b)^2] -[d/2+(T/4)]^2]}{[2(D-d/2-3(T/4)][(T/4)-D_b]}\right] \\&T=D-d-2D_b,\\&D=160, d=90, B_w=30,\\&0.5(D+d)\le D_m\le 0.6(D+d),\\&0.15(D-d)\le D_b\le 0.45(D-d),\\&4\le Z\le 50, 0.515 \le f_1\le 0.6, 0.515\le f_0 \le 0.6,\\&0.4 \le K_{D_{min}}\le 0.5, 0.6 \le K_{D_{max}}\le 0.7,\\&0.3\le \epsilon \le 0.4, 0.02\le e \le 0.1, 0.6\le \xi \le 0.85. \end{aligned}$$

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Houssein, E.H., Helmy, B.Ed., Rezk, H. et al. An efficient orthogonal opposition-based learning slime mould algorithm for maximum power point tracking. Neural Comput & Applic 34, 3671–3695 (2022). https://doi.org/10.1007/s00521-021-06634-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-021-06634-y

Keywords

Navigation