期刊文献+

蚁群算法在煤矿电力线载波通信网中的应用研究

Research of Dynamic Routing Based on Improved Dynamic Ant Colony Algorithm
下载PDF
导出
摘要 从提高煤矿低压电力线载波通信的可靠性角度出发,探讨了低压电力线载波动态路由问题,将一种新的改进动态路由算法应用于低压电力线载波通信。该方法从局部更新规则和全局更新规则两方面对基本蚁群算法进行改进,引入了局部最差路径和全局最差路径概念,提高了动态路由搜索的准确度和效率。为扩大煤矿电力线载波通信的通信范围提供了一种非常有效的动态路由方法。 This paper discusses the specialties and the methods of building up the PLC coal mine networks and a new dynamic ant colony algorithm was put forward. The algorithm is applicable for communicating in dynamic routing of PLC networks, and multi-path access technology is given. The improved DACS enhanced aspects, that is the best tours and the the accuracy and efficiency of dynamic routing in two worst tours.The simulation and experimentation indicate that using fewer iterations, the improved DACS can find the relay route in the shortest possible time.h provides an effective dynamic routing method for the expansion of PLC.
出处 《煤炭技术》 CAS 北大核心 2011年第11期36-37,共2页 Coal Technology
关键词 煤矿 电力线载波通信 动态蚁群算法 :coal mine power line communication dynamic ant colony algorithm
  • 相关文献

参考文献4

二级参考文献43

  • 1王颖,谢剑英.一种自适应蚁群算法及其仿真研究[J].系统仿真学报,2002,14(1):31-33. 被引量:232
  • 2Stuitzle T, Hoos H H. MAX- MIN ant system[J]. Future Generation Computer Systems, 2000, 16: 889-914. 被引量:1
  • 3Sttitzle T, Dorigo M. ACO algorithms for the quadratic assignment problem[ A]. In Corne D, Dorigo M, Glover F, eds., New Methods in Optimization[ M]. New York: McGraw-Hill, 1999. 被引量:1
  • 4Maniezzo V, Colorni A. The ant system applied to the quadratic assignment problem[ J]. IEEE Transactions on Knowledge and Data Engineering, 1999, 11(5): 769-778. 被引量:1
  • 5Gilmore P. Optimal and suboptimal algorithms for the quadratic assignment problem[J]. Journal of SIAM, 1962, 10: 305-313. 被引量:1
  • 6Taillard D. Robust taboo search for the quadratic assignment problem[J]. Parallel Computing, 1991, 17:443 - 455. 被引量:1
  • 7Maniezzo V. Exact and Approximate Nondeterministic Tree-search Procedures for the Quadratic Assignment Problem[R].Universitadi Bologna, Sede di Cesena, Italy, 1998. 被引量:1
  • 8Taillard D, Gambardella L M. Adaptive Memories for the Quadratic Assignment Problem[R]. IDSIA, Lugano, Switzerland: IDSIA-87-97, 1997. 被引量:1
  • 9Gambardella L M, Taillard D, Dorigo M. Ant Colonies for the QAP[R]. IDSIA-4-97, IDSIA, Lugano, Switzerland, 1997. 被引量:1
  • 10Talbi E-G, Roux O, Fonlupt C, Robillard D. Parallel Ant Colonies for the quadratic assignment problem[J]. Future Generation Computer Systems, 2001, 17: 441-449. 被引量:1

共引文献111

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部