【摘要】 利用复杂环网方向保护最优整定配合中最小断点集 (MBPS)的启发知识 ,将MBPS的计算归结为解不等式———欠定方程组 ,进而等价为 0— 1整数二次规划问题 ,基于基因遗传优化计算原理 ,首次提出了MBPS问题的基因遗传计算方法 ,降低了问题的计算复杂性。更多还原

【Abstract】 The determination of MBPS(minimum break point set)for optional coordination of directional relay in a multiloop network is reduced to solving an inequality--indefinite equation group,then reduced further to a 0-1 integer quadratic programming problem.Where the heuristic knowledge of MBPS is facility.On the basis of the principle of Gene Evolution,a new approach to determine MBPS is presented for the first time.And the computational complexity of MBPS problem is decreased.更多还原