Author
Listed:
- Ruoxi Liu
(State Grid Beijing Electric Power Research Institute, Beijing 100192, China)
- Yifan Song
(State Grid Beijing Electric Power Research Institute, Beijing 100192, China)
- Yuan Gui
(State Grid Beijing Electric Power Research Institute, Beijing 100192, China)
- Hanqi Dai
(State Grid Beijing Electric Power Research Institute, Beijing 100192, China)
- Zhiyong Wang
(State Grid Beijing Electric Power Company, Beijing 100192, China)
- Chengdong Yin
(State Grid Beijing Electric Power Research Institute, Beijing 100192, China)
- Qinglei Qin
(State Grid Beijing Yizhuang Electric Power Company, Beijing 100071, China)
- Wenqin Yang
(Department of Electrical Engineering, College of Information and Electrical Engineering, China Agricultural University, Beijing 100083, China)
- Yue Wang
(Department of Electrical Engineering, College of Information and Electrical Engineering, China Agricultural University, Beijing 100083, China)
Abstract
This paper proposes a fault self-healing recovery strategy for passive low-voltage power station areas (LVPSAs). Firstly, being aware of the typical structure and communication conditions of the LVPSAs, a fog computing load forecasting method is proposed based on a dynamic aggregation of incremental learning models. This forecasting method embeds two weighted ultra-short-term load forecasting techniques of complementary characteristics and mines real-time load to learn incrementally, and thanks to this mechanism, the method can efficiently make predictions of low-voltage loads with trivial computational burden and data storage. Secondly, the low-voltage power restoration problem is overall formulated as a three-stage mixed integer program. Specifically, the master problem is essentially a mixed integer linear program, which is mainly intended for determining the reconfiguration of binary switch states, while the slave problem, aiming at minimizing load curtailment constrained by power flow balance along with inevitable load forecast errors, is cast as mixed integer type-1 Wasserstein distributionally robust optimization. The column-and-constraint generation technique is employed to expedite the model-resolving process after the slave problem with integer variables eliminated is equated with the Karush–Kuhn–Tucker conditions. Comparative case studies are conducted to demonstrate the performance of the proposed method.
Suggested Citation
Ruoxi Liu & Yifan Song & Yuan Gui & Hanqi Dai & Zhiyong Wang & Chengdong Yin & Qinglei Qin & Wenqin Yang & Yue Wang, 2025.
"Low-Voltage Power Restoration Based on Fog Computing Load Forecasting and Data-Driven Wasserstein Distributionally Robust Optimization,"
Energies, MDPI, vol. 18(8), pages 1-20, April.
Handle:
RePEc:gam:jeners:v:18:y:2025:i:8:p:2096-:d:1637470
Download full text from publisher
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:18:y:2025:i:8:p:2096-:d:1637470. 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.
We have no bibliographic references for this item. You can help adding them by using 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.