CROSS DECOMPOSITION FOR MULTIAREA OPTIMAL REACTIVE POWER PLANNING

被引:25
作者
DEEB, NI [1 ]
SHAHIDEHPOUR, SM [1 ]
机构
[1] IIT, DEPT ELECT & COMP ENGN, CHICAGO, IL 60616 USA
关键词
REACTIVE POWER PLANNING; LINEAR PROGRAMMING; RELAXATION; BENDERS DECOMPOSITION METHOD;
D O I
10.1109/59.260957
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a novel decomposition-based algorithm to solve the reactive power planning problem in large scale multi-area power systems. Extensive studies based on the application of the Benders decomposition method (BDM) have been conducted to solve this complex problem. Nevertheless, these applications are based on the difficult evaluation of the plane cuts from the solution of the master problem. In this paper, we are introducing the possibility of solving the reactive power planning based on an iterative optimization process between the BDM subproblem and the subproblem of a Lagrangean relaxation decomposition method (LRDM). The overall process is referred to as a cross decomposition algorithm (CDA). The merits of the proposed approach are shown by the evaluation of plane cuts based on the solution of easy-to-solve subproblems. Moreover, the proposed approach is extremely efficient in multi-area (zone decomposition) power systems. Test results are demonstrated for the 3-area IEEE 30-bus and the 6-area 180-bus systems.
引用
收藏
页码:1539 / 1544
页数:6
相关论文
共 17 条