Abstract

<span id="docs-internal-guid-ea798321-7fff-3e0c-24d7-776c9b1165b3"><span>In this paper, a multi-group salp swarm algorithm (MGSSA) is presented for estimating the photovoltaic (PV) solar cell models. The SSA is a metaheuristic technique that mimics the social behavior of the salp. The salps work in a group that follow a certain leader. The leader approaches the food source and the rest follows it, hence resulting in slow convergence of SSA toward the solution. For several groups, the searching mechanism is going to be improved. In this work, a recently developed algorithm based on several salp groups is implemented to estimate the single-, double-, triple-, Quadruple-, and Quintuple-diode models of a PV solar cell. Six versions of MGSSA algorithms are developed with different chain numbers; one, two, four, six, eight and half number of the salps. The results are compared to the regular particle swarm optimization (PSO) and some of its newly developed forms. The results show that MGSSA has a faster convergence rate, and shorter settling time than SSA. Similar to the inspired actual salp chain, the leader is the most important member in the chain; the rest has less significant effect on the algorithm. Therefore, it is highly recommended to increase the number of leaders and reduce the chain length. Increasing the number of leaders (number of groups) can reduce the root mean squared error (RMSE) and maximum absolute error (MAE) by 50% of its value.</span></span>

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.