Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2863
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRani, D. Sudha-
dc.contributor.authorSubrahmanyam, N.-
dc.contributor.authorSydulu, M.-
dc.date.accessioned2025-01-22T11:22:17Z-
dc.date.available2025-01-22T11:22:17Z-
dc.date.issued2013-
dc.identifier.citation10.1109/ICEETS.2013.6533580en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2863-
dc.descriptionNITWen_US
dc.description.abstractOptimal capacitor placement is a complex combinatorial optimization process aimed at finding the location and size of capacitors on a radial distribution network that minimizes the system power and energy loss, deviation of node voltages and increases the available capacity of the feeders. A Harmony Search algorithm (HSA) is a recently developed algorithm which is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic search instead of a gradient search. In this paper, a Self Adaptive Harmony Search algorithm (SAHSA) is proposed to solve the optimal capacitor placement in order to minimize the power loss. Forward/Backward sweep power flow method is used to solve the radial distribution system. The proposed approach is tested on standard IEEE 33bus and IEEE 69-bus radial distribution systems. The results are compared with Particle Swarm Optimization (PSO) algorithm, and plant growth simulation algorithm (PGSA) and it is observed that the proposed method performed well in terms of the quality of solution.en_US
dc.language.isoenen_US
dc.publisher2013 International Conference on Energy Efficient Technologies for Sustainability, ICEETS 2013en_US
dc.subjectHarmony search,en_US
dc.subjectLoss reduction,en_US
dc.subjectCapacitor placement and loss sensitivityen_US
dc.titleSelf adaptive harmony search algorithm for optimal capacitor placement on radial distribution systemsen_US
dc.typeOtheren_US
Appears in Collections:Electrical Engineering



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