作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (14): 214-216. doi: 10.3969/j.issn.1000-3428.2011.14.072

• 人工智能及识别技术 • 上一篇    下一篇

蚁群算法在林火扑救路径选择中的应用

刘道伟 a,关 昕 b   

  1. (辽宁工程技术大学 a. 研究生学院;b. 电子与信息工程学院,辽宁 葫芦岛 125105)
  • 收稿日期:2011-01-17 出版日期:2011-07-20 发布日期:2011-07-20
  • 作者简介:刘道伟(1985-),男,硕士研究生,主研方向:网络安全,智能网络;关 昕,副教授
  • 基金资助:
    2009年度中国煤炭工业科技计划基金资助项目(MTKJ 2009-253)

Application of Ant Colony Algorithm in Forest Fires Fighting Path Selection

LIU Dao-weia, GUAN Xinb   

  1. (a. Graduate School; b. College of Electronic and Information Engineering, Liaoning Technical University, Huludao 125105, China)
  • Received:2011-01-17 Online:2011-07-20 Published:2011-07-20

摘要: 针对森林道路错乱复杂的特殊情况和蚁群算法容易出现的局部收敛问题,提出一种用于林火扑救最优路径选择的蚁群算法。在基本蚁群算法的基础上,动态计算启发式信息值并更新信息素,平衡收敛速度与停滞现象的出现概率,增大算法的搜索空间。仿真结果表明,该算法能在较短时间内找出符合实际要求的最优路径,提高蚁群的全局搜索能力。

关键词: 林火扑救, 蚁群算法, 最优路径, 拓扑结构, 道路等级

Abstract: The special circumstances of complex forest roads and the partial convergency of phenomenon which is easily to happen in ant colony algorithm, so this paper adopts to dynamic calculation method of the value of heuristic information and dynamic updating the pheromone to improve the basic ant colony algorithm. Results show that the improved algorithm can not only find to meet practical requirements of the optimal path in a relatively short time but also improve the ability of global search. It provides a new idea and method for solving the problem of optimal forest fires fighting path.

Key words: forest fires fighting, ant colony algorithm, optimal path, topological structure, road grade

中图分类号: