电力系统自动化2016，Vol.40Issue(6)：49-57,9.DOI:10.7500/AEPS20150601002
七种最优潮流分解协调算法的性能比较
Comparative Analysis of Seven Decomposition and Coordination Algorithms for Optimal Power Flow
摘要
Abstract
Currently,the decomposition-coordination algorithms used in optimal power flow (OPF) lack a unified basis for comparison.For this reason,the seven kinds of decomposition-coordination algorithm are used for solving the same power system so as to get more objective and fair conclusions.The decomposition-coordination optimal power flow algorithms based on the modern interior point theory are divided into 4 categories by using the area partition method,with the model and calculation process of each algorithm briefly described.The 4 categories are the bus splitting method,the overlap boundary method,the boundary-area partition method and the node decomposition method.In order to fully compare and analyze the performance of the 7 algorithms,2-region 600-bus and 4-region 1 200-bus systems are constructed as test cases based on an IEEE 300-bus system.Calculation results are obtained by means of vector programming,and then a comparison of the convergence,calculation speed,the amount of communication and stability is conducted.Finally,based on the MATLAB parallel laboratory,the parallel performance of each algorithm is tested.Test results show that the approximate Newton direction(AND) method has better performance in terms of calculation speed and amount of communication,while the convergence and stability of the decomposition coordination interior point method(DCIPM)is better than the other algorithms.关键词
分解协调/区域划分/并行计算/最优潮流/内点法Key words
decomposition coordination/area partition/parallel computation/optimal power flow/interior point method引用本文复制引用
汪超群,韦化,吴思缘,杨健..七种最优潮流分解协调算法的性能比较[J].电力系统自动化,2016,40(6):49-57,9.基金项目
国家重点基础研究发展计划(973计划)资助项目(2013CB228205) （973计划）
国家自然科学基金资助项目(51167001)。This work is supported by National Basic Research Program of China(973 Program)(No.2013CB228205) and National Natural Science Foundation of China(No.51167001) （51167001）
