摘要
用于配电网络优化的智能算法在选择初始可行解时,往往忽视其是否满足电网电气运行特性,从而造成求解效率不高。从配电网的拓扑模型入手,归纳通用的底层网络运行约束条件,并基于该拓扑模型提出考虑电网运行特性的通用网架简化与开关分组策略,建立应用于简化网架的辐射运行约束函数,形成满足配电网辐射状网络运行要求的初始解空间。以遗传优化算法为例,证明通过拓扑收缩去除不可行解,将以指数倍数提高优化算法的计算效率。
When choosing initial feasible solutions, the electrical characteristics of power grid may often be overlooked, lowering computational efficiency in power distribution network optimization algorithms. By proceeding from the power grid characteristics, network simplification and switches grouping are presented in this paper by analyzing the distribution network topology model based on common information model (CIM). By considering the inductive network reconfiguration constraints l solution space satisfying the radial-running condition is formed. A case study using the genetic algorithms shows that the computational efficiency of optimization algorithms will increase exponential multiples by topology contraction and removal of the infeasible solutions.
出处
《电力系统自动化》
EI
CSCD
北大核心
2012年第10期51-55,共5页
Automation of Electric Power Systems
基金
国家重点基础研究发展计划(973计划)资助项目(2009CB219703)
国家高技术研究发展计划(863计划)资助项目(2012AA050212)
上海市科技攻关重点项目(10dz1202800)~~
关键词
配电网重构
拓扑收缩
解空间优化
distribution network configuration
topology contraction
solution space optimization