基于DAOP算法的配电网电容器优化投切  

Distribution Network Optimal Capacitor Switching Based on Discrete Ascent Optimal Programming Algorithm

作　　者：张斌 

机构地区：[1]陕西省地方电力(集团)有限公司延安供电分公司,陕西延安716000

出　　处：《陕西电力》2011年第7期53-57,共5页Shanxi Electric Power

摘　　要：配电网电容器补偿使负荷无功功率具有就地平衡的特点,符合离散上升优化算法(Discrete Ascent OptimalProgramming,DAOP)的应用条件。提出了1种基于DAOP算法的电容器优化投切算法,该方法以划分的子树为优化单位,应用DAOP算法得到电容器投切组数的浮点值,并进行归整。算法继承了DAOP算法计算效率高、易考虑各种约束条件且不存在收敛问题的优点,以子树为单位分别归整,避免了统一归整计算量大且易陷入局部最优解的缺点。不同规模的配电网络分析计算结果验证了算法的准确性和实用性。The optimal capacitor switching is balanced locally in distribution networks and this characteristic is in accordance with the application condition of DAOP （Discrete Ascent Optimal Programming） algorithm. Thus this paper proposes a new optimal capacitor switching method based on DAOP algorithm. This method treats sub tree as an optimal unit. The capacitor switching float value of sub tree is obtained and integralzed. This method inherits the merits of DAOP algorithm, such as its simplicity, ease of incorporating inequality constraints, and the ability to predict the number of steps required for convergence. The integralities in the unit of sub tree avoids the disadvantages of integralities after getting switching float value of all capacitors, such as large amount of calculation, getting the local optimal solution. Different distribution systems are adopted to test the accuracy and practicality of proposed algorithm.

关 键 词：配电网 电容器优化投切 DAOP算法 

分 类 号：TM727[电气工程—电力系统及自动化]