基于蚁群禁忌搜索混合算法的配电网重构  

Distribution Network Reconfiguration Based on Ant Colony and Tabu Search Hybrid Algorithm

作　　者：王林川[1] 李漫[1] 张木子[1] 梁峰[1] 张佳[2] 

机构地区：[1]东北电力大学,吉林吉林132012 [2]余杭供电局,杭州311100

出　　处：《吉林电力》2010年第5期34-36,共3页Jilin Electric Power

摘　　要：介绍了以最小化配电网网损为目标函数,以网络拓扑约束、潮流约束、运行约束以及辐射状约束为约束条件,在基本蚁群算法基础上的改进型蚁群禁忌混合算法在配电网重构中的应用,在IEEE 69节点系统的计算中,蚁群禁忌混合算法与禁忌算法相比提高了优化效果,从而证明了蚁群禁忌混合算法的实用性。The application of improved ant colony and tabu search hybrid algorithm based on basic ant colony algorithm used in distribution network reconfiguration is introduced.The target function is defined as the loss of minimized distribution network,the constraints is defined as network topology constraints,the trend of constraints,running constraints and radial constraints.The optimization results of ant colony and tabu search hybrid algorithm are improved compared with tabu search algorithm,and the practical applicability of ant colony and tabu hybrid algorithm by simulating is verified in the IEEE69 bus system.

关 键 词：配电网重构 蚁群算法 禁忌搜索算法 蚁群禁忌搜索混合算法 

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