Abstract
In this paper, an Improved Tabu Search (ITS) algorithm has been proposed to solve the optimal reactive power problem. In this work Tabu Search- has been hybridized with Simulated Annealing algorithm to solve the optimal reactive power problem. Hybridization of these two algorithms improves the exploration & exploitation capabilities during the search. Proposed Improved Tabu Search (ITS) algorithm has been tested in Standard IEEE 57,118 bus systems & real power loss has been comparatively reduced with voltage profiles are within the limits.
Highlights
Optimal reactive power problem is key problem in secure & economic operations of power system
Proposed Improved Tabu Search (ITS) algorithm has been tested in Standard IEEE 57,118 bus systems & real power loss has been comparatively reduced with voltage profiles are within the limits
At first Improved Tabu Search (ITS) algorithm has been tested in standard IEEE-57 bus power system
Summary
Optimal reactive power problem is key problem in secure & economic operations of power system. The reactive power dispatch problem involves best utilization of the existing generator bus voltage magnitudes, transformer tap setting and the output of reactive power sources so as to minimize the loss and to enhance the voltage stability of the system. It involves a non linear optimization problem. Various mathematical techniques have been adopted to solve this optimal reactive power dispatch problem These include the gradient method [1,2], Newton method [3] and linear programming [4,5,6,7]. Proposed Improved Tabu Search (ITS) algorithm has been tested in Standard IEEE 57,118 bus systems & real power loss has been comparatively reduced with voltage profiles are within the limits
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.