Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/6741
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBabu, M. Arumuga-
dc.contributor.authorMahalakshmi, R.-
dc.contributor.authorRengaraj-
dc.date.accessioned2024-10-09T09:12:17Z-
dc.date.available2024-10-09T09:12:17Z-
dc.date.issued2019-
dc.identifier.citationBabu, M. Arumuga; Mahalakshmi, R.; Rengaraj. Comparison of various self adaptive algorithms for loss minimization in distribution network incorporated using renewable energy sources for various loads. Timişoara: Editura Politehnica, 2019.en_US
dc.identifier.issn1582-4594-
dc.identifier.urihttps://dspace.upt.ro/xmlui/handle/123456789/6741-
dc.description.abstractIn this, a correlation is made between the distribution generators, self-adaptive real-coded genetic algorithm (SARGA) and is consummated to settle the economic dispatch (ED) problem . The self adaptation is attained through tactics of tournament culling onward including simulated binary crossover (SBX). The excerpt proceeding has a dynamism expedition competence by devise combats betwixt two explication. The improved elucidation is conscript and implanted in the copulate puddle dominate to an absolute confluence and diminished reckoning concern. The population assortment is imported by composing handling of distribution index in SBX operator to conceive a better offspring.en_US
dc.language.isoenen_US
dc.publisherTimișoara : Editura Politehnicaen_US
dc.relation.ispartofseries;Vol 19 No 5-
dc.subjectPolynomial mutationen_US
dc.subjectEconomic dispatchen_US
dc.subjectDistribution generators (DG)en_US
dc.titleComparison of various self adaptive algorithms for loss minimization in distribution network incorporated using renewable energy sources for various loads [articol]en_US
dc.typeArticleen_US
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Babu_f.pdf473.64 kBAdobe PDFView/Open


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