计算机工程与应用 ›› 2014, Vol. 50 ›› Issue (23): 256-260.

• 工程与应用 • 上一篇    下一篇

基于改进蚁群算法的应急救援路线选择

崔丽群,张明杰,许  堃   

  1. 1.辽宁工程技术大学 软件学院,辽宁 葫芦岛 125105
    2.辽宁工程技术大学 通信学院,辽宁 葫芦岛 125105
  • 出版日期:2014-12-01 发布日期:2014-12-12

Improved ant colony algorithm for emergency rescue route choice

CUI Liqun, ZHANG Mingjie, XU Kun   

  1. 1.College of Software, Liaoning Technical University, Huludao, Liaoning 125105, China
    2.College of Communication, Liaoning Technical University, Huludao, Liaoning 125105, China
  • Online:2014-12-01 Published:2014-12-12

摘要: 应急救援路线的选择关系到应急救援的成败,合理有效地选择应急救援路线对挽救生命和财产具有重要意义,其属于组合优化问题。针对蚁群算法求解速度慢、算法稳定性差、易出现早熟或停滞等缺陷和应急救援路线选择的特点,主要研究了改进蚁群算法在应急救援路线选择中的应用并根据实际应用提出了应急救援路线选择的蚁群算法的数学模型,为城市应急救援路线选择提供了有效的解决方案。通过实验证明该模型可以应用到解决应急救援路线选择问题方面,具有快速、高效的特点。

关键词: 应急救援, 蚁群算法, TOP-K排序算法

Abstract: The choice of emergency rescue route is related to the success or failure of emergency rescue, and it has great significance for saving lives and properties to select a reasonable and effective emergency rescue route, and it belongs to the field of combinatorial optimization. For the slow solution, poor algorithm stability, prone to premature or stagnation and other defects of ant colony algorithm and characteristics of emergency rescue route choice, this paper mainly studies the application of improved ant colony algorithm in emergency rescue route choice and provides an effective solution for city emergency rescue route choice and according to the practical application proposes mathematical model of ant colony algorithm of emergency rescue route choice. It is proved by experiments that the model which applied to solving problems of emergency rescue route choice has fast and efficient features.

Key words: emergency rescue, ant colony algorithm, Top-K sorting algorithm