PMU OPTIMAL PLACEMENT IN POWER SYSTEM USING BINARY PSO ALGORITHM

Ketanpreet Kaur, Anantdeep kaur

Abstract


- This paper presents a new method for minimizing the number of PMUs and their optimal placement in power systems. The proposed methodology results in a reduction in the number of PMUs even though the system topological observability is complete. In this paper, an overview of PMU and their optimal placement is given. Further, a survey and optimal placement different techniques such as index based and Meta-heuristic is explained. The Meta-heuristic algorithm got lot of attention in the modern era because it is provide optimal solution based on their behavior. In this paper PMU optimal placement is done using genetic and Binary PSO algorithm on MATLAB. The results reflect that binary PSO gives optimal placement as compared to genetic algorithm in terms of execution time.

Keywords


Optimal Routing, PMU, genetic Algorithm, Binary PSO.

Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v8i7.4500

Refbacks

  • There are currently no refbacks.




Copyright (c) 2017 International Journal of Advanced Research in Computer Science