Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/98315
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharma, Abhishek-
dc.contributor.authorSharma, Abhinav-
dc.contributor.authorDasgotra, Ankit-
dc.contributor.authorJately, Vibhu-
dc.contributor.authorRam, Mangey-
dc.contributor.authorRajput, Shailendra-
dc.contributor.authorAverbukh, Moshe-
dc.contributor.authorAzzopardi, Brian-
dc.date.accessioned2022-06-23T08:49:54Z-
dc.date.available2022-06-23T08:49:54Z-
dc.date.issued2021-
dc.identifier.citationSharma, A., Sharma, A., Dasgotra, A., Jately, V., Ram, M., Rajput, S., ... & Azzopardi, B. (2021). Opposition-based tunicate swarm algorithm for parameter optimization of solar cells. IEEE Access, 9, 125590-125602.en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar/handle/123456789/98315-
dc.description.abstractParameter estimation of photovoltaic modules is an essential step to observe, analyze, and optimize the performance of solar power systems. An efficient optimization approach is needed to obtain the finest value of unknown parameters. Herewith, this article proposes a novel opposition-based tunicate swarm algorithm for parameter estimation. The proposed algorithm is developed based on the exploration and exploitation components of the tunicate swarm algorithm. The opposition-based learning mechanism is employed to improve the diversification of the search space to provide a precise solution. The parameters of three types of photovoltaic modules (two polycrystalline and one monocrystalline) are estimated using the proposed algorithm. The estimated parameters show good agreement with the measured data for three modules at different irradiance levels. Performance of the developed opposition-based tunicate swarm algorithm is compared with other predefined algorithms in terms of robustness, statistical, and convergence analysis. The root mean square error values are minimum ( 6.83×10−4 , 2.06×10−4 , and 4.48×10−6 ) compared to the tunicate swarm algorithm and other predefined algorithms. Proposed algorithm decreases the function cost by 30.11%, 97.65%, and 99.80% for the SS2018 module, SolarexMSX-60 module, and Leibold solar module, respectively, as compared to the basic tunicate swarm algorithm. The statistical results and convergence speed depicts the outstanding performance of the anticipated approach. Furthermore, the Friedman ranking tests confirm the competence and reliability of the developed approach.en_GB
dc.description.sponsorshipThis work was supported in part by the European Commission H2020 TWINNING Joint Universal activities for Mediterranean PV integration Excellence (JUMP2Excel) Project under Grant 810809.en_GB
dc.language.isoenen_GB
dc.publisherIEEEen_GB
dc.rightsinfo:eu-repo/semantics/openAccessen_GB
dc.subjectPhotovoltaic cellsen_GB
dc.subjectElectric power systemsen_GB
dc.subjectRenewable energy sourcesen_GB
dc.subjectBuilding-integrated photovoltaic systemsen_GB
dc.subjectHouseholds -- Energy consumptionen_GB
dc.subjectMachine learningen_GB
dc.subjectMetaheuristicsen_GB
dc.titleOpposition-based tunicate swarm algorithm for parameter optimization of solar cellsen_GB
dc.typearticleen_GB
dc.rights.holderThe copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.en_GB
dc.description.reviewedpeer-revieweden_GB
dc.identifier.doi10.1109/ACCESS.2021.3110849-
dc.publication.titleIEEE Accessen_GB
Appears in Collections:Scholarly Works - FacEngSCE

Files in This Item:
File Description SizeFormat 
Opposition-based tunicate swarm algorithm for parameter optimization of solar cells.pdf3.79 MBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.