中文摘要：

建立了系统从树状网络恢复到环状网络过程的数学模型，并开发了相应的算法，求取线路最佳的投入次序问题。优化算法的目标函数是系统在各接线状态下可恢复负荷量最大、发电机的出力调整量最小。算法采用逆向搜索策略，即先投入所有待恢复线路和负荷，然后再依次断开直至系统初始状态。每次断开线路后，都调用最优潮流算法求负荷、发电机出力调节量，但负荷量只减不增，这样已恢复的负荷不会因为线路潮流或线路合闸角越限再次切除。提出并讨论了2种线路开断策略，分析了仿真计算结果，提出一种改进策略。以New England-39节点和IEEE-30节点为算例验证了所提算法在不同初始条件下的效果。

英文摘要：

A math model for system reconstructing from tree shaped network to looped network is presented, and a heuristic algorithm was developed to solve the optimal recovery orders of lines. The objective function is to maximize power supply in each system state and to minimize total generation output adjustment during recovery. The algorithm adopts reverse-direction searching strategy, that is firstly puts all lines and loads to ＂on＂ state, then opens lines one by one till the original state of system is reached as the state before reconstruction. Every time after opening one line, the optimal power flow algorithm was used to solve generation and load adjustments. To guarantee recovered load would not be opened again, the amount of load in each node could only be reduced. Two heuristic rules for selecting line-opening orders were discussed. Based on the simulation results, an adapting strategy was presented. The algorithm was verified by New England-39 systems and IEEE-30 systems in different original states.