考虑保护重要度计算环网方向保护配合最小断点集

摘要:

在对复杂环网方向保护进行整定计算时，确定其最优配合顺序的核心步骤就是求解最小断点集( MBPS) 。根 据保护主后备的依赖关系，建立了计算 MBPS 的数学模型，将整定过程用一系列矩阵运算表示，并加入到约束条件。 将保护重要度引入到目标函数中，利用人工蜂群算法对模型进行求解，得到最优 MBPS。通过算例验证算法及模型的 有效性。

Abstract:

Determination of minimum break point set ( MBPS) is the first step during setting and calculation of direction protection in a complex multi － loop network． A new model for directly obtaining MBPS is established through the coordination dependency relationship of primary and backup relay． The setting process is expressed through a series of matrix operation which becomes the constraint． The relay protection importance is introduced into the objective function，and artificial bee colony algorithm is used for solving the model and obtaining the optimal MBPS． At last，it verifies the validity of the proposed algorithm and model by an example．