Skip to main content
SpringerLink
Log in

The probabilistic and reliable connected power dominating set problems

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15(4), 519–529 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Bull. Am. Math. Soc. (New Ser.) 3(2), 898–904 (1980)

    Article  MathSciNet  Google Scholar 

  3. Dua, D., Dambhare, S., Gajbhiye, R.K., Soman, S.A.: Optimal multistage scheduling of PMU placement. An ILP approach. IEEE Trans. Power Deliv. 23(4), 1812–1820 (2008)

    Article  Google Scholar 

  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

  5. Fan, N., Watson, J.: On integer programming models for the multi-channel PMU placement problem and their solution. Energy Syst. 6(1), 1–19 (2015)

    Article  Google Scholar 

  6. Qiu, F.: Probabilistic covering problems. Dissertion, Georgia Institute of Technology (2013)

  7. He, J.S., Cai, Z., Ji, S., Beyah, R., Pan, Y: A genetic algorithm for constructing a reliable MCDS in probabilistic wireless networks. In: International Conference on Wireless Algorithms, Systems, and Applications, pp. 96–107 (2011)

  8. Boria, N., Murat, C., Paschos, V.T.: The probabilistic minimum dominating set problem. Discrete Appl. Math. 234, 93–113 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  9. Mazhari, S.M., Monsef, H., Lesani, H., Fereidunian, A.: A multi-objective PMU placement method considering measurement redundancy and observability value under contingencies. IEEE Trans. Power Syst. 28(3), 2136–2146 (2013)

    Article  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 

  11. Abbasy, N.H., Ismail, H.M.: A unified approach for the optimal PMU location for power system state estimation. IEEE Trans. Power Syst. 24(2), 806–813 (2009)

    Article  Google Scholar 

  12. Chakrabarti, S., Kyriakides, E., Eliades, D.G.: Placement of synchronized measurements for power system observability. IEEE Trans. Power Deliv. 24(1), 12–19 (2009)

    Article  Google Scholar 

  13. Aminifar, F., Khodaei, A., Fotuhi-Firuzabad, M., Shahidehpour, M.: Contingency-constrained PMU placement in power networks. IEEE Trans. Power Syst. 25(1), 516–523 (2010)

    Article  Google Scholar 

  14. Abiri, E., Rashidi, F., Niknam, T.: An optimal PMU placement method for power system observability under various contingencies. Int. Trans. Electr. Energy Syst. 25(4), 589–606 (2015)

    Article  Google Scholar 

  15. Aminifar, F., Fotuhi-Firuzabad, M., Shahidehpour, M., Khodaei, A.: Probabilistic multistage PMU placement in electric power systems. IEEE Trans. Power Deliv. 26(2), 841–849 (2011)

    Article  Google Scholar 

  16. Gomez, O., Rios, M.A., Anders, G.: Reliability-based phasor measurement unit placement in power systems considering transmission line outages and channel limits. IET Gener. Transm. Distrib. 8(1), 121–130 (2014)

    Article  Google Scholar 

  17. Fan, N., Watson, J.P.: Solving the connected dominating set problem and power dominating set problem by integer programming. In: Lin, G. (eds.) Combinatorial Optimization and Applications, Lecture Notes in Computer Science, vol. 7402, pp 371–383 (2012)

  18. Ahmed, S.: Convex relaxations of chance constrained optimization problems. Optim. Lett. 8(1), 1–12 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  19. Haight, R.G., Charles, S.R., Stephanie, A.S.: An integer optimization approach to a probabilistic reserve site selection problem. Oper. Res. 48(5), 697–708 (2000)

    Article  Google Scholar 

  20. Ding, L., Gao, X., Wu, W., Lee, W., Zhu, X., Du, D.Z.: An exact algorithm for minimum CDS with shortest path constraint in wireless networks. Optim. Lett. 5(2), 297–306 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Verma, A., Butenko, S.: A distributed approximation algorithm for the bottleneck connected dominating set problem. Optim. Lett. 6(8), 1583–1595 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  22. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications, pp. 41–42. Prentice Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  23. IEEE reliability test data (2012). http://www.ee.washington.edu/research/pstca/. Accessed Jan 8 2018

Download references

Acknowledgements

We would appreciate the initial discussion with Dr. Yiwen Xu on this research.

Author information

Authors and Affiliations

  1. Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 85721, USA

    Ou Sun & Neng Fan

Authors
  1. Ou Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Neng Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neng Fan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, O., Fan, N. The probabilistic and reliable connected power dominating set problems. Optim Lett 13, 1189–1206 (2019). https://doi.org/10.1007/s11590-018-1339-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-018-1339-6

Keywords

Search

Navigation