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

利用复杂环网方向保护最优配合中最小断点集（MBPS）的启发性知识，将MBPS的计算问题等价为0-1整数规划问题。基于蚁群优化算法基本原理，构造了适用于MBPS问题的启发信息计算公式，改进了更新信息素浓度的计算方法，提出了计算MBPS的新方法。相对于其他计算MBPS的算法，所述算法所需迭代次数较少，通过一次计算即可同时获得多组最优解。

Ant Colony Optimization Algorithm Based Determination of Minimum Break Point Set for Coordination of Directional Protective Relay in Multi-loop Networks

The determination of minimum break point set (MBPS) for optimal coordination of directional relays in a multi-loop network is reduced to a 0-1 integer programming problem,where the heuristic knowledge of MBPS is facilitated.On the basis of the principle of ant colony optimization (ACO) algorithm,a new algorithm to determine MBPS is presented.The formula of calculating the heuristic information is constructed to suit to the MBPS problem,also the method of calculating the pheromone is improved.More optimal solutions can be got at the same time after once algorithm calculation,and a smaller number of the iteration is needed.