计算机与现代化

• 算法分析与设计 • 上一篇    下一篇

改进的遗传蚁群混合算法在TSP中的应用

蒋腾旭   

  1. 九江职业大学,江西九江332000
  • 收稿日期:2013-08-14 修回日期:1900-01-01 出版日期:2013-12-18 发布日期:2013-12-18

Application of Improved Genetic Ant Colony Hybrid Algorithm in TSP

JIANG Teng-xu   

  1. Jiujiang Vocational University, Jiujiang 332000, China
  • Received:2013-08-14 Revised:1900-01-01 Online:2013-12-18 Published:2013-12-18

摘要: 针对遗传算法和蚁群算法的不足,提出一种改进的遗传蚁群混合算法。该混合算法通过判定最优解的改良情况,将遗传算法和蚁群算法动态串行融合,以充分利用遗传算法的全局搜索能力和蚁群算法的正反馈机制。同时,依据信息素在正反馈过程中的重要作用,提出一种改进的带奖惩项的信息素更新机制。仿真计算结果表明,本文提出的混合算法在求解TSP方面,收敛速度和求解质量均较传统的遗传算法及蚁群算法要好。

关键词: 遗传算法, 蚁群算法, 串行融合, 改良情况, 奖惩项, 信息素更新

Abstract: Aimed at the shortcomings of genetic algorithm (GA) and ant colony algorithm (ACA), an improved genetic ant colony hybrid algorithm is presented. By determining the improved situation of the optimal solution, the hybird algorithm actualizes dynamic serial fusion for GA and ACA, which makes full use of global search ability of GA and positive feedback mechanism of ACA. Meanwhile, according as the importance of pheromone in positive feedback process, an improved pheromone update mechanism with encouragement or penalty item is proposed. Computing simulation examples show the hybrid algorithm is of much higher convergence speed and much better quality of solutions than that of classical GA or ACA.