首页> 外文期刊>European Transactions on Electrical Power >Genetic, Simulated Annealing and Tabu Search Algorithms: Three Heuristic Methods for Oprtimal Reconfiguration and Compensation of Distribution Networks
【24h】

Genetic, Simulated Annealing and Tabu Search Algorithms: Three Heuristic Methods for Oprtimal Reconfiguration and Compensation of Distribution Networks

机译:遗传,模拟退火和禁忌搜索算法:配电网最优重组和补偿的三种启发式方法

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper three heuristic methods for radial distribution networks reconfguration and capacitor control are presented. A Simulated Annealing algorithm (SA), a Genetic Algorithm (GA) and a Tabu Search algorithm (TS) with some adaptations have been applied and compared. Basic GA, SA and TS procedures, with particu- lar reference to the combinatorial OPtimization problems, are presented and adaptations are described in de- tail. Three demonstration sofware have been developed to implement the three algorithms and the perfor- mances of the three methods are then compared in terms of computation time and statistical quality' of obtai- ned solutions. Test results demonstrate that the TS algorithm type outperform the other heuristics.
机译:本文提出了三种启发式方法进行径向配网重构和电容器控制。模拟退火算法(SA),遗传算法(GA)和禁忌搜索算法(TS)进行了一些调整,并进行了比较。介绍了基本的GA,SA和TS程序,尤其是组合优化问题,并在下文详细介绍了适应方法。已经开发了三个演示软件来实现这三种算法,然后根据获得的解决方案的计算时间和统计质量比较了这三种方法的性能。测试结果表明,TS算法类型优于其他启发式算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号