IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v74y2019i3d10.1007_s10898-018-0672-8.html
   My bibliography  Save this article

Solving the multistage PMU placement problem by integer programming and equivalent network design model

Author

Listed:
  • Ou Sun

    (University of Arizona)

  • Neng Fan

    (University of Arizona)

Abstract

Recently, phasor measurement units (PMUs) are becoming widely used to measure the electrical waves on a power grid to determine the health of the system. Because of high expense for PMUs, it is important to place minimized number of PMUs on power grids without losing the function of maintaining system observability. In practice, with a budget limitation at each time point, the PMUs are placed in a multistage framework spanning in a long-term period, and the proposed multistage PMU placement problem is to find the placement strategies. Within each stage for some time point, the PMUs should be placed to maximize the observability and the complete observability should be ensured in the planned last stage. In this paper, the multistage PMU placement problem is formulated by a mixed integer program (MIP) with consideration of the zero-injection bus property in power systems. To improve the computational efficiency, another MIP, based on the equivalent network flow model for the PMU placement problem, is proposed. Numerical experiments on several test cases are performed to compare the two MIPs.

Suggested Citation

  • Ou Sun & Neng Fan, 2019. "Solving the multistage PMU placement problem by integer programming and equivalent network design model," Journal of Global Optimization, Springer, vol. 74(3), pages 477-493, July.
    • Handle: RePEc:spr:jglopt:v:74:y:2019:i:3:d:10.1007_s10898-018-0672-8
    DOI: 10.1007/s10898-018-0672-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-018-0672-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-018-0672-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Guangjun Xu & Liying Kang, 2011. "On the power domination number of the generalized Petersen graphs," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 282-291, August.
    2. Zhao Zhang & Weili Wu & Lidan Fan & Ding-Zhu Du, 2014. "Minimum vertex cover in ball graphs through local search," Journal of Global Optimization, Springer, vol. 59(2), pages 663-671, July.
    3. Xianliang Liu & Hongliang Lu & Wei Wang & Weili Wu, 2013. "PTAS for the minimum k-path connected vertex cover problem in unit disk graphs," Journal of Global Optimization, Springer, vol. 56(2), pages 449-458, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. David G. L. Wang & Monica M. Y. Wang & Shiqiang Zhang, 2022. "Determining the edge metric dimension of the generalized Petersen graph P(n, 3)," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 460-496, March.
    2. Chung-Shou Liao, 2016. "Power domination with bounded time constraints," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 725-742, February.
    3. Limin Wang & Wenxue Du & Zhao Zhang & Xiaoyan Zhang, 2017. "A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 106-122, January.
    4. Lina Chen & Xiaohui Huang & Zhao Zhang, 2018. "A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 35-43, July.
    5. Chao Wang & Lei Chen & Changhong Lu, 2016. "$$k$$ k -Power domination in block graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 865-873, February.
    6. Ran, Yingli & Zhang, Zhao & Huang, Xiaohui & Li, Xiaosong & Du, Ding-Zhu, 2019. "Approximation algorithms for minimum weight connected 3-path vertex cover," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 723-733.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:74:y:2019:i:3:d:10.1007_s10898-018-0672-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.