Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/15053
Title: Implementation and Optimal Sizing of Tcsc for the Solution of Reactive Power Planning Problem Using Quasi-Oppositional Salp Swarm Algorithm
Authors: Raj, Saurav
Mahapatra, Sheila
Shiva, Chandan Kumar
Bhattacharyya, Biplab
Keywords: Active Power Loss
Line Stability Index (Lsi)
Quasi-Oppositional Concept
Reactive Power Planning (Rpp)
Salp Swarm Algorithm (Ssa)
Thyristor Controlled Series Compensator (Tcsc)
Issue Date: 2021
Publisher: International Journal of Energy Optimization and Engineering
Igi Global
Citation: Vol. 10, No. 2; pp. 74-103
Abstract: In this article, innovative algorithms named as salp swarm algorithm (SSA) and hybrid quasi-oppositional SSA (QOSSA) techniques have been proposed for finding the optimal coordination for the solution of reactive power planning (RPP). Quasi-oppositional based learning is a promising technique for improving convergence and is implemented with SSA as a new hybrid method for RPP. The proposed techniques are successfully implemented on standard test systems for deprecation of real power losses and overall cost of operation along with retention of bus voltages under acceptable limits. Optimal planning has been achieved by minimizing reactive power generation and transformer tap settings with optimal placement and sizing of TCSC. Identification of weakest branch in the power network is done for optimal TCSC placement and is tendered through line stability index method. Optimal TCSC placement renders a reduction in transmission loss by 8.56% using SSA and 8.82% by QOSSA in IEEE 14 bus system and 7.57% using SSA and 9.64% by QOSSA in IEEE 57 bus system with respect to base condition.
URI: http://dx.doi.org/10.4018/IJEOE.2021040104
http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/15053
ISSN: 2160-9500
2160-9543
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


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