The probabilistic and reliable connected power dominating set problems
- 23 Downloads
As a variation of minimum dominating set problem, the power dominating set problem is proposed to achieve the complete observation of a power system by placing the smallest number of PMUs. Under different contingencies consisting line outages or PMU losses, the reliability of observation for each bus should be guaranteed to ensure the security and robustness of the power system. Thus, the probabilistic power dominating set (PPDS) problem is proposed in this paper. Given a pre-specified reliability level for each bus in the power system to be observed and known distribution of random events, an integer programming formulation, with consideration of zero-injection property, is presented for the PPDS problem. Additionally, the reliable connected power dominating set problem is studied to meet two requirements, including the connectivity of the PMU subgraph and the reliability of the connectivity of this subgraph. Numerical experiments based on several IEEE test cases are performed to find the best deployment of PMUs satisfying different requirements.
KeywordsPower dominating set problem Probabilistic Zero-injection buses Integer programming Reliability Connectivity
We would appreciate the initial discussion with Dr. Yiwen Xu on this research.
- 4.Sun, O., Fan, N.: Solving the multistage PMU placement problem by integer programming and equivalent network design model. J. Glob. Optim. (2018) https://doi.org/10.1007/s10898-018-0672-8
- 6.Qiu, F.: Probabilistic covering problems. Dissertion, Georgia Institute of Technology (2013)Google Scholar
- 10.Aghaei, J., Baharvandi, A., Rabiee, A., Akbari, M.A.: Probabilistic PMU placement in electric power networks: an MILP-based multiobjective model. IEEE Trans. Ind. Inform. 11(2), 332–341 (2015)Google Scholar
- 23.IEEE reliability test data (2012). http://www.ee.washington.edu/research/pstca/. Accessed Jan 8 2018