交通运输系统工程与信息

交通运输系统工程与信息 ›› 2002, Vol. 2 ›› Issue (1): 54-57 .

• 系统工程理论与方法 • 上一篇    下一篇

人工蚁群算法理论及其在经典
TSP 问题中的实现

黎锁平1， 张秀媛2， 杨海波1   

  1. 1.北京交通大学理学院, 北京100044; 2.北京交通大学交通运输学院, 北京100044
  • 收稿日期:2001-11-22 修回日期:1900-01-01 出版日期:2002-02-01 发布日期:2002-02-01

Theory on Artificial Ant Algorithm and
Its Application in TSP-Problem

LI Suo-ping1， ZHANG Xiu-yuan2，YANG Hai-bo1   

  1. 1.School of Science,Northern Jiaotong University.Beijing 100044.China;
    2.School of Traffic and Transportation, Northern Jiaotong University, Beijing 100044. China
  • Received:2001-11-22 Revised:1900-01-01 Online:2002-02-01 Published:2002-02-01

PDF

摘要： 人工蚁群算法是一种新型的模拟进化算法也是一种随机型智能搜索寻优算法.较系
统地总结了这一算法的基本理论.分析了其基本摸型和算法在TSP问题中的实现方式给出了
改进算法及其在多点通信路由问题中的应用.并对人工蚁群算法的优化性能进行了分析讨论.

关键词: 人工蚁群算法, 信息素, 轨迹, 模型

Abstract: Artificial ant algorithm is a novel simulated evolutionary algorithm, also a newly stochastic and intellectual searching optimization. This paper systematically summarizes the
fundamental theory in the algorithm, and analyses the fundamental model and the pattern of the algorithm in traveling salesman problem. The improved ant algorithm and its application for multicast routing are presented. Eventually its ability for optimizing is discussed.

Key words: artificial ant algorithm, pheromone, trail, model