Please use this identifier to cite or link to this item: http://nopr.niscpr.res.in/handle/123456789/45387
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMoghaddam, M J Hadidian-
dc.contributor.authorKalam, A-
dc.contributor.authorShi, J-
dc.contributor.authorGandoman, F H-
dc.date.accessioned2018-11-06T09:43:00Z-
dc.date.available2018-11-06T09:43:00Z-
dc.date.issued2018-11-
dc.identifier.issn0975-1084 (Online); 0022-4456 (Print)-
dc.identifier.urihttp://nopr.niscair.res.in/handle/123456789/45387-
dc.description615-620en_US
dc.description.abstractThis paper proposes a new model for reconfiguration and distributed generation allocation in distribution network conceding reduce network losses. The objective function involves minimizing losses using the new Ant Lion Optimizer (ALO) algorithm. The proposed reconfiguration on the unbalanced 33-bus IEEE base grid with and without Distributed Generation Sources (DGRs) as well as the use of capacitors have been investigated. In this study, a branching technique with an optimization method is used to determine the best network arrangement. Simulation studies are carried out under different scenarios. In each of the scenarios, the losses before and after the optimization are compared. The results indicate that, through using the proposed method the rate of the losses in the case study is reduced.en_US
dc.language.isoen_USen_US
dc.publisherNISCAIR-CSIR, Indiaen_US
dc.rights CC Attribution-Noncommercial-No Derivative Works 2.5 Indiaen_US
dc.sourceJSIR Vol.77(11) [November 2018]en_US
dc.subjectReconfigurationen_US
dc.subjectRenewable Energy Sources (RESs)en_US
dc.subjectPower flow improvementen_US
dc.subjectAdapted Ant Colony Algorithmen_US
dc.titleA Model for Reconfiguration and Distributed Generation Allocation Considering Reduction of Network Lossesen_US
dc.typeArticleen_US
Appears in Collections:JSIR Vol.77(11) [November 2018]

Files in This Item:
File Description SizeFormat 
JSIR 77(11) 615-620.pdf1.29 MBAdobe PDFView/Open


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