Author
Listed:
- Du, Jialin
- Cao, Di
- Hu, Weihao
- Zhang, Sen
- Liu, Wen
- Zhang, Zhenyuan
- Wang, Daojuan
- Chen, Zhe
Abstract
To further exploit the potential of interconnected active distribution networks in reducing overall operational risks through coordinated scheduling under source-load uncertainties, this paper proposes a distributionally robust dispatch and benefit allocation scheme. First, a collaborative risk-resistant distributionally robust optimization model based on the conditional value at risk measure is established to minimize the whole risk cost associated with the heavy-tailed distribution of uncertain variables, trading a small loss in expected economic performance for a significant gain in tail robustness. Then, by employing piecewise linearization techniques and duality theory, the introduction of integer variables is avoided, and the original semi-infinite programming problem is equivalently transformed into an efficiently solvable semidefinite programming problem. Finally, an asymmetric Nash bargaining model that accounts for risk-reduction contributions is employed to ensure a fair and equitable allocation of cooperative benefits. Simulation results based on the modified 119-bus system demonstrate that the proposed method can effectively improve the economic and robust operation of interconnected active distribution networks under source-load uncertainties. Compared with the non-cooperative distributionally robust optimization model, the day-ahead risk and intraday cost of the interconnected microgrids are reduced by 27.48% and 14.34%, respectively.
Suggested Citation
Du, Jialin & Cao, Di & Hu, Weihao & Zhang, Sen & Liu, Wen & Zhang, Zhenyuan & Wang, Daojuan & Chen, Zhe, 2026.
"Collaborative risk-resistant distributionally robust dispatch and benefit allocation scheme for interconnected distribution systems,"
Applied Energy, Elsevier, vol. 409(C).
Handle:
RePEc:eee:appene:v:409:y:2026:i:c:s0306261926001108
DOI: 10.1016/j.apenergy.2026.127458
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
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:appene:v:409:y:2026:i:c:s0306261926001108. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/405891/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.