首页> 外文会议>International Conference on Electric Utility Deregulation and Restructuring and Power Technologies >Analysis of ant colony algorithm for finding the optimal circuitous route in the communication network of power system
【24h】

Analysis of ant colony algorithm for finding the optimal circuitous route in the communication network of power system

机译:用于在电力系统通信网络中找到最优迂回路径的蚁群算法分析

获取原文

摘要

The communication network of power system is often damaged after a disaster. To solve this problem, this paper uses ant colony algorithm to find the optimal circuitous route. Simulation results show that the method is fast, which can accelerate the recovery of the communication network. Besides, this paper does some research on the dead end problem, and analyses relationship between degree of adjacency and ratio of coming to a dead end. The result shows that the efficiency of ant colony algorithm can be improved only if it tries to avoid coming to dead ends.
机译:在灾难发生后,电力系统的通信网络通常损坏。为了解决这个问题,本文使用蚁群算法找到最佳迂回路线。仿真结果表明,该方法快速,可以加速通信网络的恢复。此外,本文对死胡同问题进行了一些研究,并分析了邻接程度与即将到达死胡同的关系。结果表明,只有当它试图避免即将到止结束时,才能提高蚁群算法的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号