论文标题
维修工作人员路由用于配电网络恢复
Repair Crew Routing for Power Distribution Network Restoration
论文作者
论文摘要
随着极端天气事件的越来越频繁和破坏性，服务恢复对于许多基础架构，例如电网和通信网络变得越来越重要。在许多有关服务恢复的研究中，由于同时考虑多个网络的复杂性，因此经常忽略了在道路网络上旅行的物流问题，从而导致了长时间的破坏时间。在这项工作中，我们解决了在电力系统中产生的问题，在电力系统中，技术人员和公用车前往许多站点以修复损坏的设备，目的是最大程度地减少服务区域内的总服务中断时间。我们称此问题为电源恢复旅行修理工问题（PRTRP）。与典型的路由问题相比，它使其更具挑战性的是，位置中的服务中断时间取决于路由序列与两个网络的相互作用，即道路网络和电网。为了解决问题，我们开发了一种基于双向动态编程的精确方法。然后，我们通过使用解决方案上限和下限来减少搜索空间，以及从功率网格中的优先级关系得出的阈值规则来改善方法。我们还提出了该方法的有效启发式变体。我们提出了计算结果，并将我们的方法与基准启发式方法进行比较。
As extreme weather events become more frequent and disruptive, service restoration is increasingly important for many infrastructures, e.g., power grids and communication networks. In many studies on service restoration, the logistics issue of traveling over the road network, however, is often overlooked due to the complexity of considering multiple networks simultaneously, resulting in prolonged disruption time. In this work, we address such a problem arising in power systems, where technical crew and utility trucks travel to a number of sites to repair damaged equipment, with the goal of minimizing the total service disruption time within the service region. We call this problem the Power Restoration Traveling Repairman Problem (PRTRP). What makes it significantly more challenging than a typical routing problem is that the service disruption time in a location depends on the interaction of the routing sequence with both networks, i.e., the road network and the power grid. To solve the problem, we develop an exact method based on bi-directional dynamic programming. We then improve the method by reducing the search space with solution upper and lower bounds, and threshold rules derived from the precedence relations in the power grid. We also propose efficient heuristic variants of the method. We present computational results and compare our method with benchmark heuristics.
