检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华南理工大学电力学院,广东省广州市510640
出 处:《中国电机工程学报》2017年第17期4893-4900,共8页Proceedings of the CSEE
基 金:国家自然科学基金项目(51437006;51377058)~~
摘 要:Benders解耦技术在求解含N-1静态安全约束的最大供电能力(total supplying capability,TSC)问题上具有乐观的应用前景,但不同的求解策略存在效率和性能上的显著差异。为更高效地求解TSC问题,该文提出一种改进的伪串行策略。首先,在处理子问题时加入核心事故筛选环节,减少冗余计算量;其次,采用"逐个添加,均值反馈"策略,避免子问题对主问题的过度修正。算例分析表明,相比于现有文献中的方法,文中方法得到了更优的解,同时加快了收敛速度。文中方法可为电网的优化规划及运行提供量化辅助手段,为实现供电能力的在线计算、实时掌握电网运行的安全裕度探索实用的解决途径。Benders decomposition technique shows optimistic application potential in solving the problem of total supplying capability(TSC) with N-1 static security constraints, but different execution schemes show remarkable difference in efficiency and performance. To solve the problem more efficiently, an improved pseudo serial scheme was proposed. Firstly, when handling the slave problems, a technique which filters core contingencies was adopted to reduce computation redundancy. Then, in order to avoid slave problems making excessive correction to the master problem, slave problems corresponding to those filtered contingencies were ranked according to their severity in each iteration, and the mean-cut of the most serious ones was fed back to the master problem. Case studies indicate that, compared with other methods reported in recent literature, the proposed method finds better solution with faster convergence speed. The proposed method can provide quantitative solutions for power grid planning and operation, and evaluate the safety margin of real-time operation on line.
关 键 词:最大供电能力 N-1静态安全约束 Benders分解 核心事故筛选 伪串行策略
分 类 号:TM721[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.107.255