IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v10y2017i2p168-d89096.html
   My bibliography  Save this article

An N - k Analytic Method of Composite Generation and Transmission with Interval Load

Author

Listed:
  • Shaoyun Hong

    (Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China)

  • Haozhong Cheng

    (Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China)

  • Pingliang Zeng

    (Electric Power Research Institute of China, Beijing 100192, China)

Abstract

N - k contingency estimation plays a very important role in the operation and expansion planning of power systems, the method of which is traditionally based on heuristic screening. This paper stringently analyzes the best and worst states of power systems given the uncertainties of N - k contingency and interval load. For the sake of simplification and tractable computation, an approximate direct current (DC) power flow model was used. Rigorous optimization models were established for identifying the worst and best scenarios considering the contingencies of generators and transmission lines together with their uncertain loads. It is very useful to identify the worst N - k contingencies with interval loads. If the worst existing scenario meets security standards, all scenarios must satisfy it. The mathematical model established for finding the worst N - k contingency with interval load is a bi-level optimization model. In this paper, strong duality theory and mathematical linearization were applied to the solution of bi-level optimization. The computational results of standard cases validate the effectiveness of the proposed method and illustrate that generator contingency has more impact on minimum load shedding than transmission line contingency.

Suggested Citation

  • Shaoyun Hong & Haozhong Cheng & Pingliang Zeng, 2017. "An N - k Analytic Method of Composite Generation and Transmission with Interval Load," Energies, MDPI, vol. 10(2), pages 1-17, January.
    • Handle: RePEc:gam:jeners:v:10:y:2017:i:2:p:168-:d:89096
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/10/2/168/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/10/2/168/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jiang, Ruiwei & Zhang, Muhong & Li, Guang & Guan, Yongpei, 2014. "Two-stage network constrained robust unit commitment problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 751-762.
    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. Yilin Xie & Ying Xu, 2022. "Transmission Expansion Planning Considering Wind Power and Load Uncertainties," Energies, MDPI, vol. 15(19), pages 1-18, September.
    2. Yuhong Wang & Lei Chen & Hong Zhou & Xu Zhou & Zongsheng Zheng & Qi Zeng & Li Jiang & Liang Lu, 2021. "Flexible Transmission Network Expansion Planning Based on DQN Algorithm," Energies, MDPI, vol. 14(7), pages 1-21, April.
    3. Ziqi Wang & Jinghan He & Alexandru Nechifor & Dahai Zhang & Peter Crossley, 2017. "Identification of Critical Transmission Lines in Complex Power Networks," Energies, MDPI, vol. 10(9), pages 1-19, August.
    4. Jaber Valinejad & Mousa Marzband & Mudathir Funsho Akorede & Ian D Elliott & Radu Godina & João Carlos de Oliveira Matias & Edris Pouresmaeil, 2018. "Long-Term Decision on Wind Investment with Considering Different Load Ranges of Power Plant for Sustainable Electricity Energy Market," Sustainability, MDPI, vol. 10(10), pages 1-19, October.
    5. Zipeng Liang & Haoyong Chen & Xiaojuan Wang & Idris Ibn Idris & Bifei Tan & Cong Zhang, 2018. "An Extreme Scenario Method for Robust Transmission Expansion Planning with Wind Power Uncertainty," Energies, MDPI, vol. 11(8), pages 1-22, August.
    6. Mohammad Bagher Abolhasani Jabali & Mohammad Hosein Kazemi, 2017. "Power System Event Ranking Using a New Linear Parameter-Varying Modeling with a Wide Area Measurement System-Based Approach," Energies, MDPI, vol. 10(8), pages 1-14, July.

    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. Baringo, Luis & Boffino, Luigi & Oggioni, Giorgia, 2020. "Robust expansion planning of a distribution system with electric vehicles, storage and renewable units," Applied Energy, Elsevier, vol. 265(C).
    2. Zhang, Gaohang & Li, Fengting & Wang, Sen & Yin, Chunya, 2023. "Robust low-carbon energy and reserve scheduling considering operational risk and flexibility improvement," Energy, Elsevier, vol. 284(C).
    3. Qi, Mingyao & Yang, Ying & Cheng, Chun, 2023. "Location and inventory pre-positioning problem under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    4. Detienne, Boris & Lefebvre, Henri & Malaguti, Enrico & Monaci, Michele, 2024. "Adjustable robust optimization with objective uncertainty," European Journal of Operational Research, Elsevier, vol. 312(1), pages 373-384.
    5. Haoxiang Yang & David P. Morton & Chaithanya Bandi & Krishnamurthy Dvijotham, 2021. "Robust Optimization for Electricity Generation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 336-351, January.
    6. Zhao, Ning & You, Fengqi, 2022. "Sustainable power systems operations under renewable energy induced disjunctive uncertainties via machine learning-based robust optimization," Renewable and Sustainable Energy Reviews, Elsevier, vol. 161(C).
    7. Vieira, Matheus Pereira & Martins, André Christóvão Pio & Soler, Edilaine Martins & Balbo, Antonio Roberto & Nepomuceno, Leonardo, 2023. "Two-stage robust market clearing procedure model for day-ahead energy and reserve auctions of wind–thermal systems," Renewable Energy, Elsevier, vol. 218(C).
    8. Ricardo M. Lima & Antonio J. Conejo & Loïc Giraldi & Olivier Le Maître & Ibrahim Hoteit & Omar M. Knio, 2022. "Risk-Averse Stochastic Programming vs. Adaptive Robust Optimization: A Virtual Power Plant Application," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1795-1818, May.
    9. Heng Yang & Ziliang Jin & Jianhua Wang & Yong Zhao & Hejia Wang & Weihua Xiao, 2019. "Data-Driven Stochastic Scheduling for Energy Integrated Systems," Energies, MDPI, vol. 12(12), pages 1-21, June.
    10. Wenjuan Hou & Tao Fang & Zhi Pei & Qiao-Chu He, 2020. "Integrated Design of Unmanned Aerial Mobility Network: A Data-Driven Risk-Averse Approach," Papers 2004.13000, arXiv.org.
    11. Hou, Wenjuan & Fang, Tao & Pei, Zhi & He, Qiao-Chu, 2021. "Integrated design of unmanned aerial mobility network: A data-driven risk-averse approach," International Journal of Production Economics, Elsevier, vol. 236(C).
    12. Zheng, Wen & Xu, Xiao & Huang, Yuan & Zhu, Feng & Yang, Yuyan & Liu, Junyong & Hu, Weihao, 2023. "Adaptive robust scheduling optimization of a smart commercial building considering joint energy and reserve markets," Energy, Elsevier, vol. 283(C).
    13. Yıldıran, Uğur, 2023. "Robust multi-stage economic dispatch with renewable generation and storage," European Journal of Operational Research, Elsevier, vol. 309(2), pages 890-909.
    14. Ruiz, C. & Conejo, A.J., 2015. "Robust transmission expansion planning," European Journal of Operational Research, Elsevier, vol. 242(2), pages 390-401.
    15. Chao Li & Muhong Zhang & Kory Hedman, 2021. "Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1037-1055, July.
    16. Kramer, Anja & Krebs, Vanessa & Schmidt, Martin, 2021. "Strictly and Γ-robust counterparts of electricity market models: Perfect competition and Nash–Cournot equilibria," Operations Research Perspectives, Elsevier, vol. 8(C).
    17. Ayşe N. Arslan & Boris Detienne, 2022. "Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 857-871, March.
    18. Yanıkoğlu, İhsan & Gorissen, Bram L. & den Hertog, Dick, 2019. "A survey of adjustable robust optimization," European Journal of Operational Research, Elsevier, vol. 277(3), pages 799-813.
    19. Qiu, Haifeng & Gu, Wei & Liu, Pengxiang & Sun, Qirun & Wu, Zhi & Lu, Xi, 2022. "Application of two-stage robust optimization theory in power system scheduling under uncertainties: A review and perspective," Energy, Elsevier, vol. 251(C).
    20. Phebe Vayanos & Qing Jin & George Elissaios, 2022. "ROC++: Robust Optimization in C++," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2873-2888, November.

    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:gam:jeners:v:10:y:2017:i:2:p:168-:d:89096. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.