Skip to main content

A Consensus-Based Distributed Primal-Dual Perturbed Subgradient Algorithm for DC OPF

  • Conference paper
  • First Online:
Advanced Computational Methods in Energy, Power, Electric Vehicles, and Their Integration (ICSEE 2017, LSMS 2017)

Abstract

In this paper, an consensus-based distributed primal-dual perturbed subgradient algorithm is proposed for the DC Optimal Power Flow (OPF) problem. The algorithm is based on a double layer multi-agent structure, in which each generator bus and load bus in electric power grid is viewed as bus agent and connects with the grid by a network agent. In particular, network agents employ the average consensus method to estimate the global variables which are necessary for bus agents to update their generation using a local primal-dual perturbed subgradient method. The proposed approach is fully distributed and realizes the privacy protection. The employment of primal-dual perturbation method ensuring the convergence of the algorithm. Simulation results demonstrate the effectiveness of the proposed distributed algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Mohammadi, J., Hug, G., Kar, S.: Agent-based distributed security constrained optimal power flow. IEEE Trans. Smart Grid PP(99), 1 (2016)

    Google Scholar 

  2. Disfani, V.R., Fan, L., Miao, Z.: Distributed DC optimal power flow for radial networks through partial primal dual algorithm. In: 2015 IEEE Power & Energy Society General Meeting, pp. 1–5. IEEE (2015)

    Google Scholar 

  3. Chang, T.H., Nedic, A., Scaglione, A.: Distributed constrained optimization by consensus-based primal-dual perturbation method. IEEE Trans. Autom. Control 59(6), 1524–1538 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kallio, M.J., Ruszczynski, A.: Perturbation methods for saddle point computation. Work. Pap. 119(35), 37–59 (1994)

    Google Scholar 

  5. Binetti, G., Davoudi, A., Lewis, F.L., Naso, D.: Distributed consensus-based economic dispatch with transmission losses. Power Syst. IEEE Trans. 29(4), 1711–1720 (2014)

    Article  Google Scholar 

  6. Olshevsky, A., Tsitsiklis, J.N.: Convergence speed in distributed consensus and averaging [reprint of mr2480125]. Siam J. Control Optim. 48(1), 33–55 (2006)

    Article  MATH  Google Scholar 

  7. Wood, A.J., Wollenberg, B.F., Sheblé, G.B.: Power generation, operation and control. IEEE Power Ene. Mag. 37(3), 195 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhongyuan Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Yang, Z., Zou, B., Zhang, J. (2017). A Consensus-Based Distributed Primal-Dual Perturbed Subgradient Algorithm for DC OPF. In: Li, K., Xue, Y., Cui, S., Niu, Q., Yang, Z., Luk, P. (eds) Advanced Computational Methods in Energy, Power, Electric Vehicles, and Their Integration. ICSEE LSMS 2017 2017. Communications in Computer and Information Science, vol 763. Springer, Singapore. https://doi.org/10.1007/978-981-10-6364-0_50

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6364-0_50

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6363-3

  • Online ISBN: 978-981-10-6364-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics