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

Preventive Security-Constrained Optimal Power Flow with Probabilistic Guarantees

Author

Listed:
  • Hang Li

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan 430074, China)

  • Zhe Zhang

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan 430074, China)

  • Xianggen Yin

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan 430074, China)

  • Buhan Zhang

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan 430074, China)

Abstract

The traditional security-constrained optimal power flow (SCOPF) model under the classical N-1 criterion is implemented in the power industry to ensure the secure operation of a power system. However, with increasing uncertainties from renewable energy sources (RES) and loads, the existing SCOPF model has difficulty meeting the practical requirements of the industry. This paper proposed a novel chance-constrained preventive SCOPF model that considers the uncertainty of power injections, including RES and load, and contingency probability. The chance constraint is used to constrain the overall line flow within the limits with high probabilistic guarantees and to significantly reduce the constraint scales. The cumulant and Johnson systems were combined to accurately approximate the cumulative distribution functions, which is important in solving chance-constrained optimization problems. The simulation results show that the model proposed in this paper can achieve better performance than traditional SCOPF.

Suggested Citation

  • Hang Li & Zhe Zhang & Xianggen Yin & Buhan Zhang, 2020. "Preventive Security-Constrained Optimal Power Flow with Probabilistic Guarantees," Energies, MDPI, vol. 13(9), pages 1-13, May.
    • Handle: RePEc:gam:jeners:v:13:y:2020:i:9:p:2344-:d:355390
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/13/9/2344/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/13/9/2344/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. A. Charnes & W. W. Cooper & G. H. Symonds, 1958. "Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil," Management Science, INFORMS, vol. 4(3), pages 235-263, April.
    2. Victor H. Hinojosa & Francisco Gonzalez-Longatt, 2018. "Preventive Security-Constrained DCOPF Formulation Using Power Transmission Distribution Factors and Line Outage Distribution Factors," Energies, MDPI, vol. 11(6), pages 1-13, June.
    3. A. Charnes & W. W. Cooper, 1963. "Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints," Operations Research, INFORMS, vol. 11(1), pages 18-39, February.
    4. Soukissian, Takvor, 2013. "Use of multi-parameter distributions for offshore wind speed modeling: The Johnson SB distribution," Applied Energy, Elsevier, vol. 111(C), pages 982-1000.
    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. Glover, Fred & Sueyoshi, Toshiyuki, 2009. "Contributions of Professor William W. Cooper in Operations Research and Management Science," European Journal of Operational Research, Elsevier, vol. 197(1), pages 1-16, August.
    2. Wenqing Chen & Melvyn Sim, 2009. "Goal-Driven Optimization," Operations Research, INFORMS, vol. 57(2), pages 342-357, April.
    3. Maji, Chandi Charan, 1975. "Intertemporal allocation of irrigation water in the Mayurakshi Project (India): an application of deterministic and chance-constrained linear programming," ISU General Staff Papers 197501010800006381, Iowa State University, Department of Economics.
    4. Yongjia Song & Minjiao Zhang, 2015. "Chance‐constrained multi‐terminal network design problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 321-334, June.
    5. Rashed Khanjani Shiraz & Madjid Tavana & Hirofumi Fukuyama, 2021. "A joint chance-constrained data envelopment analysis model with random output data," Operational Research, Springer, vol. 21(2), pages 1255-1277, June.
    6. Xin Chen & Melvyn Sim & Peng Sun, 2007. "A Robust Optimization Perspective on Stochastic Programming," Operations Research, INFORMS, vol. 55(6), pages 1058-1071, December.
    7. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    8. Wu, Desheng (Dash) & Lee, Chi-Guhn, 2010. "Stochastic DEA with ordinal data applied to a multi-attribute pricing problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1679-1688, December.
    9. Giada Spaccapanico Proietti & Mariagiulia Matteucci & Stefania Mignani & Bernard P. Veldkamp, 2024. "Chance-Constrained Automated Test Assembly," Journal of Educational and Behavioral Statistics, , vol. 49(1), pages 92-120, February.
    10. Guigues, Vincent & Juditsky, Anatoli & Nemirovski, Arkadi, 2021. "Constant Depth Decision Rules for multistage optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 223-232.
    11. Xiao Liu & Simge Küçükyavuz, 2018. "A polyhedral study of the static probabilistic lot-sizing problem," Annals of Operations Research, Springer, vol. 261(1), pages 233-254, February.
    12. Aouam, Tarik & Brahimi, Nadjib, 2013. "Integrated production planning and order acceptance under uncertainty: A robust optimization approach," European Journal of Operational Research, Elsevier, vol. 228(3), pages 504-515.
    13. R. Banker & W. Cooper & E. Grifell-Tajté & Jesús Pastor & Paul Wilson & Eduardo Ley & C. Lovell, 1994. "Validation and generalization of DEA and its uses," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 2(2), pages 249-314, December.
    14. Elmaghraby, Salah E. & Soewandi, Hanijanto & Yao, Ming-Jong, 2001. "Chance-constrained programming in activity networks: A critical evaluation," European Journal of Operational Research, Elsevier, vol. 131(2), pages 440-458, June.
    15. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    16. Bilsel, R. Ufuk & Ravindran, A., 2011. "A multiobjective chance constrained programming model for supplier selection under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1284-1300, September.
    17. Zervopoulos, Panagiotis & Emrouznejad, Ali & Sklavos, Sokratis, 2019. "A Bayesian approach for correcting bias of data envelopment analysis estimators," MPRA Paper 91886, University Library of Munich, Germany.
    18. Yanikoglu, I. & den Hertog, D., 2011. "Safe Approximations of Chance Constraints Using Historical Data," Other publications TiSEM ab77f6f2-248a-42f1-bde1-0, Tilburg University, School of Economics and Management.
    19. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    20. R. Caballero & E. Cerda & M. Muñoz & L. Rey, 2002. "Analysis and comparisons of some solution concepts for stochastic programming problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 101-123, June.

    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:13:y:2020:i:9:p:2344-:d:355390. 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.