基于人工蜂群算法的环网方向保护配合最小断点集计算 artificial bee colony algorithm based determination of minimum break point set for coordination of directional protective relay in multi-loop networks.pdfVIP

第41 卷 第6 期 电力系统保护与控制 Vol.41 No.6 2013 年3 月16 日 Power System Protection and Control Mar.16, 2013 基于人工蜂群算法的环网方向保护配合最小断点集计算 1 1 2 周文越 , 吕飞鹏, 廖小君 (1. 四川大学电气信息学院，四川 成都 610065；2. 四川省电力职业技术学院，四川 成都 610072） 摘要：在对复杂环网方向保护进行整定计算时，确定其最优配合顺序的核心步骤就是求解最小断点集 （MBPS)。将MBPS 的求 解问题转化为一个0-1 整数规划问题。引入最大独立断点集的概念，改进目标函数。运用人工蜂群算法对模型进行求解，并 对算法进行了改进，将禁忌搜索引入人工蜂群算法,进而减少了算法所需迭代的次数,并能通过一次计算就得到多组 MBPS。 通过算例验证方法的正确性。 关键词：最小断点集；整定计算；人工蜂群算法；禁忌搜索；最大独立断点集 Artificial bee colony algorithm based determination of minimum break point set for coordination of directional protective relay in multi-loop networks ZHOU Wen-yue1 1 2 , Lü Fei-peng , LIAO Xiao-jun (1. School of Electrical Engineering and Information, Sichuan University, Chengdu 610065, China; 2. Sichuan Electric Power Vocational Technical College, Chengdu 610072, China) Abstract: Determination of minimum break point set (MBPS) is the core step of getting the optimal coordination sequence during setting and calculation of protection in a complex multi-loop network. This paper equates it to a 0-1 integer programming problem. The maximum independent break point is introduced for improving the target function. Then the problem is solved via artificial bee colony algorithm. The algorithm is improved by introducing the tabu search, which can reduce number of iterations and get many MBPS in a calculation. The correctness of the method is verified by an example. Key words: MBPS; relay setting calculation; artificial bee colony; tabu