Abstract
This paper deals with the backtracking search algorithm (BSA) optimization technique to solve the design problems of multi-machine power system stabilizers (PSSs) in large power system. Power system stability problem is formulated by an optimization problem using the LTI state space model of the power system. To conduct a comprehensive analysis, two test systems (2-AREA and 5-AREA) are considered to explain the variation of design performance with increase in system size. Additionally, two metaheuristic algorithms, namely bacterial foraging optimization algorithm (BFOA) and particle swarm optimization (PSO) are accounted to evaluate the overall design assessment. The obtained results show that BSA is superior to find consistent solution than BFOA and PSO regardless of system size. The damping performance that achieved from both test systems are sufficient to achieve fast system stability. System stability in linearized model is ensured in terms of eigenvalue shifting towards stability regions. On the other hand, damping performance in the non-linear model is evaluated in terms of overshoot and setting times. The obtained damping in both test systems are stable for BSA based design. However, BFOA and PSO based design perform worst in case of large power system. It is also found that the performance of BSA is not affected for large numbers of parameter optimization compared to PSO, and BFOA optimization techniques. This unique feature encourages recommending the developed backtracking search algorithm for PSS design of large multi-machine power system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.