首页> 外文会议>IEEE International Conference on Power Systems Technology >Optimal Coordination of Directional Overcurrent Relays Using Enhanced L-SHADE Algorithm
【24h】

Optimal Coordination of Directional Overcurrent Relays Using Enhanced L-SHADE Algorithm

机译:使用增强型L-SHADE算法的方向性过流继电器的最佳协调

获取原文

摘要

An optimization model based protection coordination method of directional overcurrent relays (DOCRs) in highly interconnected large size meshed power system network is a complex task due to its nature of highly constrained non-linear optimization problem. To overcome this complexity of DOCRs coordination, this paper proposes an optimal protection coordination of DOCRs considering optimal selection of standard time-current characteristic curves using enhanced linear population size reduction technique of success history based adaptive differential evolution (enhanced L-SHADE/eL-SHADE) algorithm which is an advanced version of differential evolution (DE) algorithm. The conventional L-SHADE algorithm is enhanced in three steps with a novel mutation strategy, incorporation of random local search by sequential quadratic programming and non-linear population size reduction scheme. Furthermore, an effectiveness of the proposed algorithm is validated by testing it on standard IEEE-30 bus and 57 bus meshed networks. A promising and highly competitive simulation results are obtained when compared with similar results presented in reference articles by other optimization algorithms. The evaluation criteria of the eL-SHADE algorithm is considered on the basis of objective function value, standard deviation, execution time and violation of constraints.
机译:基于优化模型的定向过电流继电器(DOCRS)的保护协调方法(DOCRS)在高互连的大尺寸网状电力系统网络中是一种复杂的任务,因为它具有高度约束的非线性优化问题的性质。为了克服DOCR​​S协调的这种复杂性,本文提出了使用基于增强的基于历史的自适应差分演化的增强的线性群体尺寸减少技术,考虑到最佳选择标准时间电流特性曲线的最佳保护协调)算法是差分演进(DE)算法的高级版本。传统的L-SHADE算法以新颖的突变策略的三个步骤增强,通过顺序二次编程和非线性群体尺寸减小方案结合随机本地搜索。此外,通过在标准IEEE-30总线和57个总线网状网络上测试它来验证所提出的算法的有效性。与其他优化算法中的参考文章中的类似结果相比,获得了有希望和高竞争力的模拟结果。基于客观函数值,标准偏差,执行时间和约束的违规,考虑EL-SHADE算法的评估标准。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号