检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海交通大学电子信息与电气工程学院,上海市200240
出 处:《电力系统自动化》2008年第9期30-33,共4页Automation of Electric Power Systems
基 金:上海市重点科技攻关项目(041612012);高等学校优秀青年教师教学科研奖励计划资助项目(ZDXM03006)~~
摘 要:计及高压输电网络中的不确定因素,提出了区间负荷下快速评估电力系统安全性的新算法。该算法对传统分支定界算法进行了改进,证明了电力系统最小切负荷问题的负荷边界特性,将双层规划模型的求解转化为少量线性规划模型的求解。改进后的分支定界算法能够快速、准确地求解基于双层线性规划的区间至多切负荷模型,得到区间负荷下计及发电机的可调作用时,基于直流潮流模型的系统最小切负荷量的最大值。新算法的计算速度大大优于求解同类问题时所用的蒙特卡罗模拟法和分支定界法,精度较高。6节点和46节点系统算例的计算结果验证了算法的正确性和有效性。A fast assessment algorithm of power system security is proposed to handle the interval uncertainty of loads existing in high-voltage transmission network. Firstly, the proposed algorithm makes an enhancement to conventional branch and bound method, proves the load boundary characteristics of minimum load cutting problem in power systems, which means load of each bus is fixed at its maximum value or minimum value in the most dangerous load conditions. Based on these characteristics, a bilevel linear programming model is obtained and solved by solving a few linear programming models. This novel model is expressed as a DC power flow model, and the enhanced branch and bound algorithm can solve this model quickly and precisely to get the maximum value of the minimum load cutting amount of different schemes, with generators' regulatory abilities considered. Comparing with Monte-Carlo method and the conventional branch-and-bound method, the enhanced algorithm shows great advantages in speed and precision. The testing results on 6-bus and 46-bus power systems validate the efficiency of the proposed algorithm.
关 键 词:区间负荷 安全性评估 双层线性规划 分支定界法 电力系统
分 类 号:TM73[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.143.5.121