检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周明[1] 谌中杰[1] 李庚银[1] 秦建华[2]
机构地区:[1]华北电力大学电气与电子工程学院,北京市昌平区102206 [2]山东电力集团公司,山东省聊城市252000
出 处:《中国电机工程学报》2011年第22期48-55,共8页Proceedings of the CSEE
基 金:国家自然科学基金项目(50877027)~~
摘 要:针对交直流混合电网输电能力计算这一问题,建立包含多端直流系统的交直流电网可用输电能力(availabletransfer capability,ATC)的计算模型,提出一种主从迭代连续潮流算法,针对常规连续潮流算法中节点功率的恒功率因数增长模式,提出采用模态分析技术从考虑静态电压稳定的角度,找出一种对特定区域间ATC影响最大的负荷增长方式;发电机出力调整采用经济调度模式,实现了考虑静态电压稳定约束、兼顾安全性与经济性的ATC计算。将直流系统灵活的控制及调整策略以安全合理性原则融入迭代过程中。改进的IEEE 30节点系统算例表明:所采用的节点注入功率优化模式及主从迭代连续潮流法能计算交直流电网的考虑静态电压稳定约束的安全经济的ATC,还能指出对系统ATC影响大的关键节点。To the recently emerging need of computing AC/DC hybrid transmission system's transfer capability, a model for the AC/DC system available transfer capability (ATC) determination with multi-terminal DC (MTDC) system was set up in this paper. A master-slave iterative continuation power flow (CPF) approach was proposed to solve the model. Instead of conventional linear nodal power increase mode, the modal analysis was adopted to find the worst load increase case for dealing with static voltage stability constraint in ATC determination, while economic dispatch was applied to generation adjustment. The proposed approach is aimed to discover the most reliable and economic ATC through a bi-objective optimization. The flexible control functions of DC systems were involved in the CPF by rationality and security principles. The modified IEEE 30-bus system was used to verify the proposed model and algorithm, the test results show that the adopted nodal power increase mode and the proposed master-slave iterative CPF can discover a reliable and economic ATC for the AC/DC transmission system with static voltage stability into account, and provide the key load nodes that affects the ATC mostly.
关 键 词:交直流系统 可用输电能力 模态分析 主从迭代连续潮流法 静态电压稳定
分 类 号:TM72[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222