Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/3608
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMuleta, Negasa-
dc.contributor.authorBadar, Altaf Q.H.-
dc.date.accessioned2025-12-16T09:35:40Z-
dc.date.available2025-12-16T09:35:40Z-
dc.date.issued2023-
dc.identifier.citation10.1016/j.jer.2023.100011en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/3608-
dc.descriptionNITWen_US
dc.description.abstractElectricity is regarded as a basic human requirement. Electric demand is met using either the grid (online) or the off-grid (standalone) method. The electrification of loads in remote areas requires high investment costs for extending the transmission system. A standalone Microgrid (MG) system is a low-cost method of supplying electricity to remote areas where a grid connection is not possible. This study concentrates on designing an optimal MG model for rural electrification with different renewable energy resources. The performance of the system is evaluated by considering power system reliability, economic costs, and greenhouse gas emission ef fects. To obtain the optimal design parameters (i.e., component sizing), different optimization techniques like Particle Swarm Optimization (PSO), Differential Evolution (DE), Manta Ray Foraging Optimization (MRFO), Shuffled Frog-Leaping Algorithm (SFLA), Reptile Search Algorithm (RSA) and RUNge Kutta Optimizer (RUN) are implemented and compared. The goal of these optimization methods is to find the most reliable and cost- effective modelen_US
dc.language.isoenen_US
dc.publisherJournal of Engineering Research (Kuwait)en_US
dc.subjectCost of Energyen_US
dc.subjectEvolutionary Optimization Techniquesen_US
dc.titleDesigning of an optimal standalone hybrid renewable energy micro-grid model through different algorithmsen_US
dc.typeArticleen_US
Appears in Collections:Electrical Engineering

Files in This Item:
File Description SizeFormat 
196.pdf1.76 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.