检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王辉 郝丽丽 黄梅[2] 张圣健 王轶峰 吉宇[2] 李乃双 WANG Hui;HAO Lili;HUANG Mei;ZHANG Shengjian;WANG Yifeng;JI Yu;LI Naishuang(College of Electrical Engineering and Control Science,Nanjing Tech University,Nanjing 211816,China;Nantong Electric Power Company,Nantong 226006,China;NARI Group Corporation(State Grid Electric Power Research Institute),Nanjing 211106,China)
机构地区:[1]南京工业大学电气工程与控制科学学院,南京211816 [2]南通供电公司,江苏南通226006 [3]南瑞集团有限公司(国网电力科学研究院),南京211106
出 处:《电力电容器与无功补偿》2020年第5期158-163,170,共7页Power Capacitor & Reactive Power Compensation
基 金:江苏省“六大人才高峰”项目(XNY-020);国网江苏省电力公司科技项目(J2018110)。
摘 要:配网故障恢复实质上是通过开关操作将失电区域的负荷转移到有剩余容量的联络备用或可孤岛运行的DG上,是一种多目标多约束的优化问题。本文介绍了电网电压薄弱环节的识别方法,在与电源存在通路的区域内通过判断电压薄弱环节,进一步剔除存在越限风险的节点,确定可恢复区域,对失电负荷进行重要度排序,并基于收益、风险、代价建立配电网停电恢复策略的优化模型,采用启发式算法进行求解,得到恢复过程中的目标节点和恢复路径。利用算例系统验证了本文所提方法的合理性。Fault recovery of distribution network is actually to transfer the load from power loss area to the contact reserve with remaining capacity or the island operated DG through the operation of the switch,which is a multi-objective and multi-constrained optimiz ation problem.In this paper,the identific ation method of the weak link of network voltage is introduced.By way of judging the weak link of voltage in the area with channel with power supply,the node with the risk exceeding the limit is further eliminated and the recoverable area is determined.Moreover,the importance of the power loss is sorted,based on the benefit,risk,and cost,the optimization model for the power outage recovery strategy of the distribution network is established.The heuristic algorithm is used for solution so to obtain the target nodes and recovery paths in the recovery process.The rationality of the proposed method is verified by a numerical example system.
分 类 号:TM73[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222