IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v13y2021i14p7577-d589803.html

State-Aware Stochastic Optimal Power Flow

Author

Listed:
  • Parikshit Pareek

    (School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore)

  • Hung D. Nguyen

    (School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore)

Abstract

The increase in distributed generation (DG) and variable load mandates system operators to perform decision-making considering uncertainties. This paper introduces a novel state-aware stochastic optimal power flow (SA-SOPF) problem formulation. The proposed SA-SOPF has objective to find a day-ahead base-solution that minimizes the generation cost and expectation of deviations in generation and node voltage set-points during real-time operation. We formulate SA-SOPF for a given affine policy and employ Gaussian process learning to obtain a distributionally robust (DR) affine policy for generation and voltage set-point change in real-time. In simulations, the GP-based affine policy has shown distributional robustness over three different uncertainty distributions for IEEE 14-bus system. The results also depict that the proposed SA-OPF formulation can reduce the expectation in voltage and generation deviation more than 60 % in real-time operation with an additional day-ahead scheduling cost of 4.68 % only for 14-bus system. For, in a 30-bus system, the reduction in generation and voltage deviation, the expectation is achieved to be greater than 90% for 1.195% extra generation cost. These results are strong indicators of possibility of achieving the day-ahead solution which lead to lower real-time deviation with minimal cost increase.

Suggested Citation

  • Parikshit Pareek & Hung D. Nguyen, 2021. "State-Aware Stochastic Optimal Power Flow," Sustainability, MDPI, vol. 13(14), pages 1-16, July.
    • Handle: RePEc:gam:jsusta:v:13:y:2021:i:14:p:7577-:d:589803
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/13/14/7577/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/13/14/7577/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    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. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    2. Zhang, Hanxiao & Li, Yan-Fu, 2022. "Robust optimization on redundancy allocation problems in multi-state and continuous-state series–parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 218(PA).
    3. Li, Jinfeng & Zhao, Songzheng & Makboul, Salma & Zhang, Zhongping & Wang, Yang & Huang, Mingjun, 2026. "Distributionally robust master surgery scheduling with duration uncertainty and specialty parallelism," Omega, Elsevier, vol. 138(C).
    4. Jose Blanchet & Henry Lam & Yang Liu & Ruodu Wang, 2025. "Convolution Bounds on Quantile Aggregation," Operations Research, INFORMS, vol. 73(5), pages 2761-2781, September.
    5. Chen, Xiaoming & He, Ruichun & Li, Haijun & Li, Yinzhen & Xiong, Yi & Ju, Yuxiang & Li, Zhuo, 2026. "Designing a cross-regional emergency response network considering spatiotemporal evolution: A smart predict-then-optimise method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 206(C).
    6. M. A. Lejeune & H. N. Nguyen, 2026. "Distributionally robust fractional optimization of probability of exceedance," Journal of Global Optimization, Springer, vol. 94(1), pages 127-174, January.
    7. Chassein, André & Goerigk, Marc, 2018. "Compromise solutions for robust combinatorial optimization with variable-sized uncertainty," European Journal of Operational Research, Elsevier, vol. 269(2), pages 544-555.
    8. Enrico Bartolini & Dominik Goeke & Michael Schneider & Mengdie Ye, 2021. "The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 371-394, March.
    9. Sara Mattia & Michael Poss, 2018. "A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation," Computational Optimization and Applications, Springer, vol. 69(3), pages 753-800, April.
    10. Viet Anh Nguyen & Daniel Kuhn & Peyman Mohajerin Esfahani, 2018. "Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator," Papers 1805.07194, arXiv.org.
    11. Cao, Wenqiang & Yu, Junqi & Ru, Chengyi & Wang, Meng & Wang, Ke, 2025. "A two-stage distributionally robust optimization operation scheduling model for solar PT-PV systems based on integrated load consumption prediction," Energy, Elsevier, vol. 332(C).
    12. Li Chen & Long He & Yangfang (Helen) Zhou, 2024. "An Exponential Cone Programming Approach for Managing Electric Vehicle Charging," Operations Research, INFORMS, vol. 72(5), pages 2215-2240, September.
    13. Zhenzhen Zhang & Yu Zhang & Roberto Baldacci, 2024. "Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework," Transportation Science, INFORMS, vol. 58(4), pages 761-780, July.
    14. Taozeng Zhu & Jingui Xie & Melvyn Sim, 2022. "Joint Estimation and Robustness Optimization," Management Science, INFORMS, vol. 68(3), pages 1659-1677, March.
    15. 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.
    16. Walid Ben-Ameur & Adam Ouorou & Guanglei Wang & Mateusz Żotkiewicz, 2018. "Multipolar robust optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 395-434, December.
    17. Liu, Shihai & Yang, Ruofei & Liu, Ying, 2026. "New distributionally robust optimization framework and algorithm for energy hub scheduling integrating demand response programs under ambiguous prices and loads," Applied Energy, Elsevier, vol. 405(C).
    18. Feng, Jie & Ran, Lun & Wang, Zhiyuan & Zhang, Mengling, 2024. "Optimal energy scheduling of virtual power plant integrating electric vehicles and energy storage systems under uncertainty," Energy, Elsevier, vol. 309(C).
    19. Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2026. "On the Optimality of Affine Decision Rules in Distributionally Robust Optimization," Management Science, INFORMS, vol. 72(2), pages 1456-1471, February.
    20. 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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:jsusta:v:13:y:2021:i:14:p:7577-:d:589803. 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.