Emergency Repair Path Planning of Power Distribution Station Under Flood Disaster

Flood disasters may lead to faults in power distribution stations. When faults occur, it is necessary to plan repair paths after the disaster, so that the power distribution stations can return to normal working status as soon as possible. This paper takes the shortest total path of emergency repair vehicles as the objective function. It limits that each power distribution station can only be visited by one emergency repair vehicle, and all power distribution stations must be visited. Finally, all emergency repair vehicles return to the emergency repair center. The genetic algorithm and gray wolf algorithm are used respectively to plan the path. Finally, the optimal path is obtained and the performance difference between the two algorithms is compared. When the scale of the repair problem is relatively large, the genetic algorithm can be used preferentially, and when the scale of the repair problem is medium, the gray wolf algorithm can be used preferentially.