摘要
配电网络重构是一个非常复杂的大规模组合优化问题。本文提出了一种新颖的基于蚁群最优的算法来求解正常运行条件下的配电网络重构问题 ,以达到损失最小。蚁群最优算法 ( Ant Colony Optimization,简称 ACO算法 )是一种新型通用内启发式算法。在求解组合最优问题上 ,ACO算法已被证明是非常有效的。 ACO算法本质上是一个多代理系统 ,在这个系统中单个代理之间的交互导致了整个蚁群的复杂行为。这种方法的主要特征是正反馈、分布式计算以及富有建设性的贪婪启发式搜索的运用。为了证明本文提出的算法的可行性和有效性 ,我们研究了两个算例系统 ,并给出了计算结果。结论表明 。
Distribution network reconfiguration for loss minimization is a complex,large scale combinatorial optimization problem.In this paper,a novel algorithm for the reconfiguration of distribution networks in order to reduce the power energy losses under normal operation conditions is presented.The proposed algorithm is based on Ant Colony Optimization(ACO)approach,which is a new general purpose meta heuristic and has been demonstrated to be effective in solving hard combinatorial optimization problems.ACO algorithm is basically a multi agent system where low level interactions between single agents result in a complex behavior of the whole ant colony.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,two example systems have been studied.The numerical results are also given in the paper,which reveal that the proposed method is rather promising.
出处
《电力系统及其自动化学报》
CSCD
2001年第2期48-53,共6页
Proceedings of the CSU-EPSA
关键词
配电网络重构
数学模型
电力系统
蚁群最优算法
distribution network reconfiguration, loss reduction, Ant Colony Optimization(ACO)
