基于蚁群最优算法的配电网重构  

An Antcolony Optmization Algorithm for Reconfiguration of Distribution Systems

作　　者：蔡国伟[1] 张言滨[1] 孙铭泽[1] 辛鹏[1] 王继松[2] 

机构地区：[1]东北电力大学电气工程学院,吉林吉林132012 [2]济南钢铁集团总公司中板厂,山东济南250101

出　　处：《东北电力大学学报》2007年第4期6-11,共6页Journal of Northeast Electric Power University

摘　　要：在电力系统中配电网的重构是配电网降低网络损耗的重要途径。但是由于配网本身的结构,其重构是一个非常复杂的大规模组合优化问题。提出了基于蚁群最优的算法来求解故障情况下的配电网络重构问题,通过改变开关的闭合状态来改变网络的拓扑结构,以达到网络损失最小。蚁群最优算法(Ant colony Optimization,简称 ACO 算法)是模仿现实中的蚂蚁寻食的过程来求解配电网的重构问题。这种方法的主要特征是正反馈、分布式计算以及富有建设姓的贪婪启发式搜索的运用。该算法不依赖各种初始参数,不易陷于局部最优,为了验证本文提出的算法的可行性和有效性,我们研究了一个算例。结果表明,蚁群算法与现有各种方法相比,具有适应性好、计算效率高、优化效果好的优点。In electrical power systems, the network reconfiguration of distribution systems is a very important way to save energy. Reconfigurations are typically large, complex, combinatorial, optimization problems. This paper presents an ant colony optimization（ACO） algorithm for there configuration of distribution networks in order to reduce energy losses under disturbance conditions. ACO is being applied to reconfigure the system. ACO develops the behavior of real ants into a series of steps which finds to be a most efficient network reconfiguration. The main characteristics of this method are positive feedback, distributed computation, and the use of a constructive greedy heuristic. To demonstrate the validity and effectiveness of the proposed method, an example system has been studied. The numerical results demonstrate rapid search and good convergence of the algorithm.

关 键 词：配电网络 网络重构 损失最小 蚁群最优算法 

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