摘要
首先定义了一种基于重构次数的配电网优化模型,提出一种基于开关组的禁忌搜索算法求解优化模型。该方法用开关组状态作为编码的网络结构部分,减小了决策变量维数和不可行解的数量;用三进制时间码作为编码的时间部分,统一了码位取值范围,方便了禁忌表长度和终止条件的确定。另外,利用禁构规则来指导禁忌算法中邻域的生成,既减少了候选解个数,又避免了禁忌搜索中死循环的产生,大大提高了搜索的效率和质量。最后,通过与其他方法的比较,验证了所述算法的快速、有效性。
A mathematic model for distribution network dynamic optimization considering reconfiguration times is presented and then a switch group-based Tabu algorithm is proposed to solve this problem. The codes of decision variables are composed of two parts, i.e. net frame section and time section. One hand the net frame section is made up of switch group status, which considerably reduces the dimensions of decision variables and the number of infeasible solutions. On the other hand the ternary number system is used in time section, which uniforms the value range of variables and facilitates the determination of Tabu table length and termination condition. In addition, the neighborhood searching in Tabu algorithm is instructed by forbidden rules, which not only reduce the number of candidates, but also avoid the occurrence of dead circle, thus promoting the searching efficiency and quality. At last, comparisons between the new algorithm and other algorithm are made to verify the new one＇s speed and effectiveness.
出处
《电力系统自动化》
EI
CSCD
北大核心
2008年第11期56-60,共5页
Automation of Electric Power Systems
关键词
配电网
动态重构
开关组
禁忌算法
distribution network
dynamic reconfiguration
switch group
Tabu algorithm
