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

Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty

Author

Listed:
  • Aigner, Kevin-Martin
  • Clarner, Jan-Patrick
  • Liers, Frauke
  • Martin, Alexander

Abstract

We propose a mathematical optimization model and its solution for joint chance constrained DC Optimal Power Flow. In this application, it is particularly important that there is a high probability of transmission limits being satisfied, even in the case of uncertain or fluctuating feed-in from renewable energy sources. In critical network situations where the network risks overload, renewable energy feed-in has to be curtailed by the transmission system operator (TSO). The TSO can reduce the feed-in in discrete steps at each network node. The proposed optimization model minimizes curtailment while ensuring that there is a high probability of transmission limits being maintained. The latter is modeled via (joint) chance constraints that are computationally challenging. Thus, we propose a solution approach based on the robust safe approximation of these constraints. Hereby, probabilistic constraints are replaced by robust constraints with suitably defined uncertainty sets constructed from historical data. The ability to discretely control the power feed-in then leads to a robust optimization problem with decision-dependent uncertainties, i.e. the uncertainty sets depend on decision variables. We propose an equivalent mixed-integer linear reformulation for box uncertainties with the exact linearization of bilinear terms. Finally, we present numerical results for different test cases from the Nesta archive, as well as for a real network. We consider the discrete curtailment of solar feed-in, for which we use real-world weather and network data. The experimental tests demonstrate the effectiveness of this method and run times are very fast. Moreover, on average the calculated robust solutions only lead to a small increase in curtailment, when compared to nominal solutions.

Suggested Citation

  • Aigner, Kevin-Martin & Clarner, Jan-Patrick & Liers, Frauke & Martin, Alexander, 2022. "Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty," European Journal of Operational Research, Elsevier, vol. 301(1), pages 318-333.
  • Handle: RePEc:eee:ejores:v:301:y:2022:i:1:p:318-333
    DOI: 10.1016/j.ejor.2021.10.051
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2021.10.051?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. Xing Hong & Miguel A. Lejeune & Nilay Noyan, 2015. "Stochastic network design for disaster preparedness," IISE Transactions, Taylor & Francis Journals, vol. 47(4), pages 329-357, April.
    2. Bruce L. Miller & Harvey M. Wagner, 1965. "Chance Constrained Programming with Joint Constraints," Operations Research, INFORMS, vol. 13(6), pages 930-945, December.
    3. Lars Hellemo & Paul I. Barton & Asgeir Tomasgard, 2018. "Decision-dependent probabilities in stochastic programs with recourse," Computational Management Science, Springer, vol. 15(3), pages 369-395, October.
    4. R. Jagannathan, 1974. "Chance-Constrained Programming with Joint Constraints," Operations Research, INFORMS, vol. 22(2), pages 358-372, April.
    5. Lukáš Adam & Martin Branda & Holger Heitsch & René Henrion, 2020. "Solving joint chance constrained problems using regularization and Benders’ decomposition," Annals of Operations Research, Springer, vol. 292(2), pages 683-709, September.
    6. Zohrizadeh, Fariba & Josz, Cedric & Jin, Ming & Madani, Ramtin & Lavaei, Javad & Sojoudi, Somayeh, 2020. "A survey on conic relaxations of optimal power flow problem," European Journal of Operational Research, Elsevier, vol. 287(2), pages 391-409.
    7. Nemirovski, Arkadi, 2012. "On safe tractable approximations of chance constraints," European Journal of Operational Research, Elsevier, vol. 219(3), pages 707-718.
    8. Basciftci, Beste & Ahmed, Shabbir & Shen, Siqian, 2021. "Distributionally robust facility location problem under decision-dependent stochastic demand," European Journal of Operational Research, Elsevier, vol. 292(2), pages 548-561.
    9. Chen, J.J. & Wu, Q.H. & Zhang, L.L. & Wu, P.Z., 2017. "Multi-objective mean–variance–skewness model for nonconvex and stochastic optimal power flow considering wind power and load uncertainties," European Journal of Operational Research, Elsevier, vol. 263(2), pages 719-732.
    10. Gorissen, Bram L. & Yanıkoğlu, İhsan & den Hertog, Dick, 2015. "A practical guide to robust optimization," Omega, Elsevier, vol. 53(C), pages 124-137.
    11. Ke-wei Ding, 2014. "Distributionally Robust Joint Chance Constrained Problem under Moment Uncertainty," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-8, June.
    12. Beste Basciftci & Shabbir Ahmed & Nagi Gebraeel, 2020. "Data-driven maintenance and operations scheduling in power systems under decision-dependent uncertainty," IISE Transactions, Taylor & Francis Journals, vol. 52(6), pages 589-602, June.
    13. B. K. Pagnoncelli & S. Ahmed & A. Shapiro, 2009. "Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 399-416, August.
    14. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    15. G. C. Calafiore & L. El Ghaoui, 2006. "On Distributionally Robust Chance-Constrained Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 130(1), pages 1-22, July.
    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. Mohammadi Fathabad, Abolhassan & Cheng, Jianqiang & Pan, Kai & Yang, Boshi, 2023. "Asymptotically tight conic approximations for chance-constrained AC optimal power flow," European Journal of Operational Research, Elsevier, vol. 305(2), pages 738-753.
    2. Zhang, Mengling & Jiao, Zihao & Ran, Lun & Zhang, Yuli, 2023. "Optimal energy and reserve scheduling in a renewable-dominant power system," Omega, Elsevier, vol. 118(C).

    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. van der Laan, Niels & Teunter, Ruud H. & Romeijnders, Ward & Kilic, Onur A., 2022. "The data-driven newsvendor problem: Achieving on-target service-levels using distributionally robust chance-constrained optimization," International Journal of Production Economics, Elsevier, vol. 249(C).
    2. Skolfield, J. Kyle & Escobedo, Adolfo R., 2022. "Operations research in optimal power flow: A guide to recent and emerging methodologies and applications," European Journal of Operational Research, Elsevier, vol. 300(2), pages 387-404.
    3. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
    4. Diglio, Antonio & Peiró, Juanjo & Piccolo, Carmela & Saldanha-da-Gama, Francisco, 2023. "Approximation schemes for districting problems with probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 307(1), pages 233-248.
    5. Zhiping Chen & Shen Peng & Jia Liu, 2018. "Data-Driven Robust Chance Constrained Problems: A Mixture Model Approach," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 1065-1085, December.
    6. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    7. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
    8. 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.
    9. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    10. Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo & Newman, Alexandra, 2024. "A target-time-windows technique for project scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 314(2), pages 792-806.
    11. 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.
    12. Viktoryia Buhayenko & Dick den Hertog, 2017. "Adjustable Robust Optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6801-6823, November.
    13. Jiang, Jie & Peng, Shen, 2024. "Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 616-627.
    14. Chen, Zhen & Archibald, Thomas W., 2024. "Maximizing the survival probability in a cash flow inventory problem with a joint service level constraint," International Journal of Production Economics, Elsevier, vol. 270(C).
    15. Tito Homem-de-Mello & Qingxia Kong & Rodrigo Godoy-Barba, 2022. "A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2845-2865, September.
    16. Diah Chaerani & Adibah Shuib & Tomy Perdana & Athaya Zahrani Irmansyah, 2023. "Systematic Literature Review on Robust Optimization in Solving Sustainable Development Goals (SDGs) Problems during the COVID-19 Pandemic," Sustainability, MDPI, vol. 15(7), pages 1-18, March.
    17. Feng, Wei & Feng, Yiping & Zhang, Qi, 2021. "Multistage robust mixed-integer optimization under endogenous uncertainty," European Journal of Operational Research, Elsevier, vol. 294(2), pages 460-475.
    18. Basciftci, Beste & Ahmed, Shabbir & Shen, Siqian, 2021. "Distributionally robust facility location problem under decision-dependent stochastic demand," European Journal of Operational Research, Elsevier, vol. 292(2), pages 548-561.
    19. D. K. Mohanty & Avik Pradhan & M. P. Biswal, 2020. "Chance constrained programming with some non-normal continuous random variables," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1281-1298, December.
    20. Zheng Zhang & Brian T. Denton & Xiaolan Xie, 2020. "Branch and Price for Chance-Constrained Bin Packing," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 547-564, July.

    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:301:y:2022:i:1:p:318-333. 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.