Co-ordination of directional over current relays(DOCR) requires the selection and setting of relays so as to sequentially isolate only that portion of the power system where an abnormality has occurred.The problem of ...Co-ordination of directional over current relays(DOCR) requires the selection and setting of relays so as to sequentially isolate only that portion of the power system where an abnormality has occurred.The problem of coordinating protective relays in electrical power systems consists of selecting suitable settings such that their fundamental protective function is met,given operational requirements of sensitivity,selectivity,reliability and speed.Directional over current relays are best suited for protection of an interconnected sub-station transmission system.One of the major problems associated with this type of protection is the difficulty in coordinating relays.To insure proper coordination,all the main/back up relay pairs must be determined.This paper presents an effective algorithm to determine the minimum number of break points and main/back up relay pairs using relative sequence matrix(RSM).A novel optimization technique based on evolutionary programming was developed using these main/back up relay pairs for directional over current relay coordination in multi-loop networks.Since the problem has multi-optimum points,conventional mathematics based optimization techniques may sometimes fail.Hence evolutionary programming(EP) was used,as it is a stochastic multi-point search optimization algorithm capable of escaping from the local optimum problem,giving a better chance of reaching a global optimum.The method developed was tested on an existing 6 bus,7 line system and better results were obtained than with conventional methods.展开更多
现有关于无线定向网络广播的研究主要集中于如何选择中继节点或计算转发概率以提升分组递交率,减少广播冗余,但未对中继节点选择及波束指向计算开展联合设计,导致源节点及中继节点在广播过程中存在冗余指向,增加了消息转发次数。为提升...现有关于无线定向网络广播的研究主要集中于如何选择中继节点或计算转发概率以提升分组递交率,减少广播冗余,但未对中继节点选择及波束指向计算开展联合设计,导致源节点及中继节点在广播过程中存在冗余指向,增加了消息转发次数。为提升无线定向网络广播效率,提出一种基于最大完全子图与最小树形图的无线定向网络广播算法(maximum complete subgraph and minimum arborescence based directional broadcasting algorithm,MCSMA)。算法首先利用最大完全子图理论计算源节点或中继节点波束指向,使单个波束指向覆盖的邻居节点数量最多,然后利用最小树形图理论选择中继节点,使中继节点使用少量波束覆盖全网所有节点,降低广播过程中的消息转发次数。仿真表明,所提算法可有效减少广播过程中源节点和中继节点的波束指向次数,提升定向广播效率。展开更多
文摘Co-ordination of directional over current relays(DOCR) requires the selection and setting of relays so as to sequentially isolate only that portion of the power system where an abnormality has occurred.The problem of coordinating protective relays in electrical power systems consists of selecting suitable settings such that their fundamental protective function is met,given operational requirements of sensitivity,selectivity,reliability and speed.Directional over current relays are best suited for protection of an interconnected sub-station transmission system.One of the major problems associated with this type of protection is the difficulty in coordinating relays.To insure proper coordination,all the main/back up relay pairs must be determined.This paper presents an effective algorithm to determine the minimum number of break points and main/back up relay pairs using relative sequence matrix(RSM).A novel optimization technique based on evolutionary programming was developed using these main/back up relay pairs for directional over current relay coordination in multi-loop networks.Since the problem has multi-optimum points,conventional mathematics based optimization techniques may sometimes fail.Hence evolutionary programming(EP) was used,as it is a stochastic multi-point search optimization algorithm capable of escaping from the local optimum problem,giving a better chance of reaching a global optimum.The method developed was tested on an existing 6 bus,7 line system and better results were obtained than with conventional methods.
文摘现有关于无线定向网络广播的研究主要集中于如何选择中继节点或计算转发概率以提升分组递交率,减少广播冗余,但未对中继节点选择及波束指向计算开展联合设计,导致源节点及中继节点在广播过程中存在冗余指向,增加了消息转发次数。为提升无线定向网络广播效率,提出一种基于最大完全子图与最小树形图的无线定向网络广播算法(maximum complete subgraph and minimum arborescence based directional broadcasting algorithm,MCSMA)。算法首先利用最大完全子图理论计算源节点或中继节点波束指向,使单个波束指向覆盖的邻居节点数量最多,然后利用最小树形图理论选择中继节点,使中继节点使用少量波束覆盖全网所有节点,降低广播过程中的消息转发次数。仿真表明,所提算法可有效减少广播过程中源节点和中继节点的波束指向次数,提升定向广播效率。
