基于蚁群算法计算环网保护配合最小断点集的新方法  

A Novel Method for the Determination of the Minimum Break Point Set of Directional Protective Relays in a Multi-loop Networks Based on Ant Colony Optimization Algorithm

作　　者：吕飞鹏[1] 刘丹 

机构地区：[1]四川大学电气信息学院,四川成都610065 [2]湖南省超高压管理局二分局,湖南长沙410004

出　　处：《四川大学学报（工程科学版）》2010年第4期142-147,共6页Journal of Sichuan University (Engineering Science Edition)

基　　金：四川省应用基础研究资助项目(2007JY085)

摘　　要：为解决大规模复杂环网方向保护最优配合问题,利用保护主后备依赖关系,建立了直接计算最小断点集MBPS的新的数学模型。基于蚁群优化(ACO)算法基本原理,通过构造适用于MBPS问题的启发信息计算公式,提出了对所建数学模型求解的方法。相对于已有的计算MBPS的方法,本文建立的数学模型完全不需要计算网络所有有向回路,算法所需迭代次数较少,通过一次计算可同时获得多组最优解。通过算例验证了本文方法的有效性。In order to solve the optimal coordination problem of directional relays in a complicated multi-loop power networks,a new model for directly obtaining MBPS（ Minimum Break Point Set ） was established through the primary/backup relay’s coordination dependency relationships. Based on the ACO （ Ant Colony Optimization） algorithm,a new algorithm was presented to solve the model. The formula of calculating the heuristic information was constructed to suit the MBPS problem. Compared to the available methods,the determination of the all directed loops of networks was completely avoided. More optimal solutions could be achieved at the same time after once algorithm calculation,and a smaller number of the iteration was required. The method was validated by the example.

关 键 词：保护整定计算 节点邻接矩阵 蚁群优化 最小断点集 

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