Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1672
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMuneender, E .-
dc.contributor.authorVinod Kumar, D. M.-
dc.date.accessioned2024-11-22T05:21:29Z-
dc.date.available2024-11-22T05:21:29Z-
dc.date.issued2009-
dc.identifier.citation10.1109/PSCE.2009.4840021en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1672-
dc.descriptionNITWen_US
dc.description.abstractIn deregulated electricity market transmission congestion occurs when there is insufficient transmission capacity to simultaneously accommodate all requests for transmission service within a region. One of the most important tasks of Independent System Operator (ISO) is to manage congestion as it threatens system security and may cause rise in electricity price resulting in market inefficiency. In corrective action of congestion management schemes, it is crucial for ISO to select the most sensitive generators to re-schedule their real and reactive powers in congestion management. In this paper the optimal rescheduling of both real and reactive power to minimize the total congestion cost using Particle Swarm Optimization (PSO) and Real Coded Genetic Algorithm (RCGA) is proposed. And the selection of most sensitive generators to re-dispatch both the real and reactive powers is done using Transmission Congestion Distribution Factors (TCDFs) [3, 17]. The proposed methods have been tested on a practical 75-bus Indian System.en_US
dc.language.isoenen_US
dc.publisher2009 IEEE/PES Power Systems Conference and Exposition, PSCE 2009en_US
dc.subjectCongestion Managementen_US
dc.subjectCongestion Distribution Factorsen_US
dc.titleA Zonal Congestion Management Using PSO and Real Coded Genetic Algorithmen_US
dc.typeOtheren_US
Appears in Collections:Electrical Engineering

Files in This Item:
File Description SizeFormat 
A_zonal_congestion_management_using_PSO_and_Real_Coded_Genetic_Algorithm.pdf389.61 kBAdobe PDFView/Open


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