Distribution network restoration with mobile resources dispatch: A simulation-based online dynamic programming approach

IF 5 2区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Mingxuan Li , Wei Wei , Yin Xu , Ying Wang , Shanshan Shi
{"title":"Distribution network restoration with mobile resources dispatch: A simulation-based online dynamic programming approach","authors":"Mingxuan Li ,&nbsp;Wei Wei ,&nbsp;Yin Xu ,&nbsp;Ying Wang ,&nbsp;Shanshan Shi","doi":"10.1016/j.ijepes.2025.110667","DOIUrl":null,"url":null,"abstract":"<div><div>Dispatching mobile resources such as repair crews and mobile emergency generators is essential for the rapid restoration of distribution systems after extreme events. However, the restoration process is affected by various uncertain factors including repair time, road condition, and newly observed failures, necessitating online decision-making in response to real-time information. This paper proposes a simulation-based online dynamic programming approach to provide real-time restoration actions considering the dispatch of mobile resources. Using an index-based priority rule as the base policy, the remaining cumulative loss at the current state and a given action is evaluated from online simulation. As the base policy is explicit, the simulation is efficient. Then, the action leading to the minimum cumulative loss is chosen. It is proven that such a strategy improves the performance of base policy. The proposed policy adapts to real-time information updates and does not rely on offline training, so incurs no data and convergence-related issues, which is important in restoration tasks where the historical data of extreme events is rare. The rolling optimization approach may not meet the requirement of online use, because routing mobile resources gives rise to large-scale discrete optimization problems. Case studies on 123-bus and 8500-bus systems demonstrate that the proposed method achieves higher efficiency and better performance compared with rolling horizon optimization.</div></div>","PeriodicalId":50326,"journal":{"name":"International Journal of Electrical Power & Energy Systems","volume":"168 ","pages":"Article 110667"},"PeriodicalIF":5.0000,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Electrical Power & Energy Systems","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0142061525002182","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Dispatching mobile resources such as repair crews and mobile emergency generators is essential for the rapid restoration of distribution systems after extreme events. However, the restoration process is affected by various uncertain factors including repair time, road condition, and newly observed failures, necessitating online decision-making in response to real-time information. This paper proposes a simulation-based online dynamic programming approach to provide real-time restoration actions considering the dispatch of mobile resources. Using an index-based priority rule as the base policy, the remaining cumulative loss at the current state and a given action is evaluated from online simulation. As the base policy is explicit, the simulation is efficient. Then, the action leading to the minimum cumulative loss is chosen. It is proven that such a strategy improves the performance of base policy. The proposed policy adapts to real-time information updates and does not rely on offline training, so incurs no data and convergence-related issues, which is important in restoration tasks where the historical data of extreme events is rare. The rolling optimization approach may not meet the requirement of online use, because routing mobile resources gives rise to large-scale discrete optimization problems. Case studies on 123-bus and 8500-bus systems demonstrate that the proposed method achieves higher efficiency and better performance compared with rolling horizon optimization.
基于移动资源调度的配电网恢复:一种基于仿真的在线动态规划方法
派遣移动资源,如维修人员和移动应急发电机,对于极端事件后配电系统的快速恢复至关重要。然而,修复过程受到各种不确定因素的影响,包括修复时间、道路状况和新观察到的故障,需要根据实时信息进行在线决策。本文提出了一种基于仿真的在线动态规划方法,以提供考虑移动资源调度的实时恢复动作。使用基于索引的优先级规则作为基本策略,从在线模拟中评估当前状态和给定操作下的剩余累积损失。由于基本策略是显式的,因此仿真是高效的。然后,选择导致最小累积损失的动作。实验证明,该策略提高了基本策略的性能。该策略适应实时信息更新,不依赖于离线训练,不存在数据和收敛问题,对于极端事件历史数据较少的恢复任务具有重要意义。滚动优化方法可能不能满足在线使用的要求,因为路由移动资源会产生大规模的离散优化问题。对123总线和8500总线系统的实例分析表明,与滚动水平优化相比,该方法具有更高的效率和更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Electrical Power & Energy Systems
International Journal of Electrical Power & Energy Systems 工程技术-工程:电子与电气
CiteScore
12.10
自引率
17.30%
发文量
1022
审稿时长
51 days
期刊介绍: The journal covers theoretical developments in electrical power and energy systems and their applications. The coverage embraces: generation and network planning; reliability; long and short term operation; expert systems; neural networks; object oriented systems; system control centres; database and information systems; stock and parameter estimation; system security and adequacy; network theory, modelling and computation; small and large system dynamics; dynamic model identification; on-line control including load and switching control; protection; distribution systems; energy economics; impact of non-conventional systems; and man-machine interfaces. As well as original research papers, the journal publishes short contributions, book reviews and conference reports. All papers are peer-reviewed by at least two referees.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信