IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v243y2015i3p985-994.html
   My bibliography  Save this article

Hybrid search for the optimal PMU placement problem on a power grid

Author

Listed:
  • Liao, Chung-Shou
  • Hsieh, Tsung-Jung
  • Guo, Xian-Chang
  • Liu, Jian-Hong
  • Chu, Chia-Chi

Abstract

With increasing global concerns regarding energy management, the concept of the smart grid has become a particularly important interdisciplinary research topic. In order to continually monitor a power utility system and efficiently observe all of the states of electric nodes and branches on a smart grid, placing PMUs (phasor measurement units) at selected nodes on the grid can monitor the operation conditions of the entire power grid. This study investigates methods for minimizing the high installation costs of PMUs, in order to monitor the entire system using a set of PMUs according to the power observation rules. Notably, this problem of monitoring a power grid can be transformed into the OPP (optimal PMU placement) problem. The objective is to simultaneously minimize the number of PMUs and ensure the complete observability of the whole power grid. This combinatorial optimization problem has been shown to be NP-complete. In this paper, we propose a hybrid two-phase algorithm for this problem. The first phase of the algorithm quickly identifies a set of candidate locations of PMUs based on a graph-theoretic decomposition approach for the power domination problem in tree-type graphs. Then, we use a local search heuristic method to derive the minimum number of PMUs in the second phase. In addition to the practical model, this study also considers the ideal model, in which all load nodes are assumed to be zero injection. The numerical studies on various IEEE power test systems demonstrate the superior performance of the proposed algorithm in both the models in regard to computational time and solution quality. In particular, in the ideal model, the number of PMUs required for the test systems can be significantly reduced. We also provide theoretical lower bounds on the number of installed PMUs in the ideal model and show that the derived solution can achieve the bound of the test systems.

Suggested Citation

  • Liao, Chung-Shou & Hsieh, Tsung-Jung & Guo, Xian-Chang & Liu, Jian-Hong & Chu, Chia-Chi, 2015. "Hybrid search for the optimal PMU placement problem on a power grid," European Journal of Operational Research, Elsevier, vol. 243(3), pages 985-994.
  • Handle: RePEc:eee:ejores:v:243:y:2015:i:3:p:985-994
    DOI: 10.1016/j.ejor.2014.12.047
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714010650
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2014.12.047?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. Konak, Abdullah, 2012. "Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation," European Journal of Operational Research, Elsevier, vol. 218(3), pages 829-837.
    2. Ashkan Aazami, 2010. "Domination in graphs with bounded propagation: algorithms, formulations and hardness results," Journal of Combinatorial Optimization, Springer, vol. 19(4), pages 429-456, May.
    3. Szeto, W.Y. & Wu, Yongzhong & Ho, Sin C., 2011. "An artificial bee colony algorithm for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 126-135, November.
    4. Contreras, Ivan & Fernández, Elena & Marín, Alfredo, 2010. "The Tree of Hubs Location Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 390-400, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rohit Babu & Vikash Kumar Gupta & Kanna Subbaramaiah, 2022. "An Approach to Unravel the Optimal PMU Placement Problem for Full Observability of Power Network in View of Contingencies," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(3), pages 1170-1186, June.
    2. Ding, Weiyong & Xu, Maochao & Huang, Yu & Zhao, Peng & Song, Fengyi, 2021. "Cyber attacks on PMU placement in a smart grid: Characterization and optimization," Reliability Engineering and System Safety, Elsevier, vol. 212(C).
    3. Luis Hernández-Callejo, 2019. "A Comprehensive Review of Operation and Control, Maintenance and Lifespan Management, Grid Planning and Design, and Metering in Smart Grids," Energies, MDPI, vol. 12(9), pages 1-50, April.
    4. Rocchetta, Roberto & Zio, Enrico & Patelli, Edoardo, 2018. "A power-flow emulator approach for resilience assessment of repairable power grids subject to weather-induced failures and data deficiency," Applied Energy, Elsevier, vol. 210(C), pages 339-350.

    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. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun, 2014. "A bi-objective turning restriction design problem in urban road networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 426-439.
    2. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    3. Alumur, Sibel A. & Yaman, Hande & Kara, Bahar Y., 2012. "Hierarchical multimodal hub location problem with time-definite deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1107-1120.
    4. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    5. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Alternate solution approaches for competitive hub location problems," European Journal of Operational Research, Elsevier, vol. 290(1), pages 68-80.
    6. Peter C. Schuur & Christopher N. Kellersmann, 2022. "Improving Transport Logistics by Aligning Long Combination Vehicles via Mobile Hub & Spoke Systems," Logistics, MDPI, vol. 6(1), pages 1-18, February.
    7. Prosenjit Bose & Valentin Gledel & Claire Pennarun & Sander Verdonschot, 2020. "Power domination on triangular grids with triangular and hexagonal shape," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 482-500, August.
    8. Wang, Zutong & Guo, Jiansheng & Zheng, Mingfa & Wang, Ying, 2015. "Uncertain multiobjective traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 478-489.
    9. Nigam, Ashutosh & Agarwal, Yogesh K., 2014. "Optimal relay node placement in delay constrained wireless sensor network design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 220-233.
    10. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2012. "Multimodal hub location and hub network design," Omega, Elsevier, vol. 40(6), pages 927-939.
    11. Zhan, Xingbin & Szeto, W.Y. & Shui, C.S. & Chen, Xiqun (Michael), 2021. "A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    12. Qi Liu & Gengzhong Feng & Nengmin Wang & Giri Kumar Tayi, 2018. "A multi-objective model for discovering high-quality knowledge based on data quality and prior knowledge," Information Systems Frontiers, Springer, vol. 20(2), pages 401-416, April.
    13. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2018. "Exact solution of hub network design problems with profits," European Journal of Operational Research, Elsevier, vol. 266(1), pages 57-71.
    14. Yazar, Başak & Arslan, Okan & Karaşan, Oya Ekin & Kara, Bahar Y., 2016. "Fiber optical network design problems: A case for Turkey," Omega, Elsevier, vol. 63(C), pages 23-40.
    15. Qi Liu & Gengzhong Feng & Giri Kumar Tayi & Jun Tian, 2021. "Managing Data Quality of the Data Warehouse: A Chance-Constrained Programming Approach," Information Systems Frontiers, Springer, vol. 23(2), pages 375-389, April.
    16. Yiyong Xiao & Abdullah Konak, 2017. "A variable neighborhood search for the network design problem with relays," Journal of Heuristics, Springer, vol. 23(2), pages 137-164, June.
    17. Boris Brimkov & Derek Mikesell & Logan Smith, 2019. "Connected power domination in graphs," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 292-315, July.
    18. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    19. Lüer-Villagra, Armin & Marianov, Vladimir, 2013. "A competitive hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 231(3), pages 734-744.
    20. Ozgur Kabadurmus & Alice E. Smith, 2016. "Multi-commodity k-splittable survivable network design problems with relays," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 62(1), pages 123-133, May.

    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:eee:ejores:v:243:y:2015:i:3:p:985-994. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.