互联电网的直流最优潮流分解算法研究.pdfVIP

26 卷 12 期 中 国 电 机 工 程 学 报 Vol.26 No.12 Jun. 2006 2006 年6 月 Proceedings of the CSEE 2006 Chin.Soc.for Elec.Eng. 文章编号：0258-8013 (2006) 12-0021-05 中图分类号：TM74 文献标识码：A 学科分类号：47040 互联电网的直流最优潮流分解算法研究 1 2 1 , , 刘科研 盛万兴 李运华 1.北京航空航天大学，北京市 海淀区100083; 2. 中国电力科学研究院，北京市 海淀区100085 ） Research on Decomposition Algorithm of DC Optimal Power Flow in Large Scale Interconnection Power Grids 1 2 1 LIU Keyan , SHENG Wanxing , LI Yunhua ( 1. Beijing University of Aeronautics and Astronautics, Haidian District, Beijing, 100083, China; 2. China Electric Power Research Institute, Haidian District, Beijing 100085, China) ABSTRACT: This paper investigated an optimal method of 关键词：互联电网；最优潮流；区域分解；二次规划；部分 optimal power flow in large scale interconnected power grids. A 对偶；并行求解 decomposition collaborative model based on partial duality is analyzed, and a parallel algorithm based on DC optimal power 0 引言 flow model is presented in multi-region decomposition of 在电力市场环境下，输电网络开放和电力系统 interconnected power grids. The OPF computation of large 互联正成为电力市场的发展方向，对于大系统互联 power grid is decomposed into multi regions subproblems, which is a quadratic programming problem used to solve a DC 电网而言，尽管每个区域都有自己的独立系统运行 optimal power flow. The