一种改进蚁群算法在配电网络规划中的应用  

Application of an Improved Ant Colony Algorithm in Distribution Network Planning

作　　者：孟海林[1] 杨燕翔[1] 王家炜[1] 陈伟[1] 

机构地区：[1]西华大学电气信息学院,四川成都610039

出　　处：《西华大学学报（自然科学版）》2013年第3期81-84,共4页Journal of Xihua University:Natural Science Edition

摘　　要：在基本蚁群算法的基础上,将蚂蚁经过路径上各路段的次数与信息素更新机制相关联,改进了信息素更新方式,旨在提高蚁群算法的寻优能力和收敛到最优解的速度。将改进算法应用于只考虑过负荷约束和网络辐射型约束、以网络年综合费用和过负荷惩罚费用之和最小为目标函数的配电网规划问题中。通过一个10 kV配电网络规划问题的算例验证表明,改进算法在寻优能力和收敛速度方面均有所提高。Based on basic ant colony algorithm, this paper presnets an improved pheromone update method, which associates the number that ants have passed the sections of the whole crossing paths with the pheromone update mechanism, aiming at improving the optimization ability and the speed of convergence to optimal solution. The improved algorithm is applied to the distribution network planning, in which only the load constraints and radiation network constraints are considered, whose objective function is the minimum fee of the network annual cost and the overload punishment cost. A case for a 10 kV power network optimization proved the validity of this approach.

关 键 词：蚁群算法 配电网规划 启发算法 组合优化 

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