检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]三峡大学电气信息学院,湖北省宜昌市443002 [2]中国南方电网公司,广东省广州市510620
出 处:《中国电机工程学报》2008年第10期32-36,共5页Proceedings of the CSEE
基 金:国家自然科学基金项目(50307006)~~
摘 要:建立了系统从树状网络恢复到环状网络过程的数学模型,并开发了相应的算法,求取线路最佳的投入次序问题。优化算法的目标函数是系统在各接线状态下可恢复负荷量最大、发电机的出力调整量最小。算法采用逆向搜索策略,即先投入所有待恢复线路和负荷,然后再依次断开直至系统初始状态。每次断开线路后,都调用最优潮流算法求负荷、发电机出力调节量,但负荷量只减不增,这样已恢复的负荷不会因为线路潮流或线路合闸角越限再次切除。提出并讨论了2种线路开断策略,分析了仿真计算结果,提出一种改进策略。以NewEngland-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.
分 类 号:TM73[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.4.171