Abstract
AbstractThis paper presents a graph theory-based novel optimal PMU placement strategy. The proposed strategy provides complete feasible solution space by working on binary connectivity matrix. The binary connectivity matrix is built using graph theory. Multiple optimal solutions are obtained from the feasible solution space. Multiple optimal solutions will provide choice to the operators to choose a particular optimal solution which has a good fit to the considered other minor objectives rather than providing single optimal solution. The proposed approach is tested on IEEE-14 and IEEE-30-bus system. It is observed that, the proposed method guarantees complete set of multiple global optimal solutions.KeywordsOptimal PMU placementGraph theoryPMU
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
