Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (23): 193-195.DOI: 10.3778/j.issn.1002-8331.2009.23.054

• 工程与应用 • Previous Articles     Next Articles

tudy on travel route planning based on improved ant colony algorithm

XU Feng,DU Jun-ping   

  1. Beijing Key Lab of Intelligent Telecommunication Software and Multimedia,School of Computer Science,Beijing University of Posts and Telecommunications,Beijing 100876,China
  • Received:2009-02-26 Revised:2009-04-15 Online:2009-08-11 Published:2009-08-11
  • Contact: XU Feng


徐 锋,杜军平   

  1. 北京邮电大学 智能通信软件与多媒体北京市重点实验室,北京 100876
  • 通讯作者: 徐 锋

Abstract: This paper presents the casual meeting algorithm based on the basic ant colony algorithm and increases the quality for ant’s each tour for ant colony algorithm.Facing to the issue of travel route planning,this paper improves the calculating method of distance,and realizes the dynamic route planning for this algorithm and achieve scenic spot load balancing.The effective method for travel route planning based on improved ant colony algorithm is put forward.The experimental results show that the method is effective and practical.

摘要: 在研究了基本蚁群算法后提出了偶遇算法,提高了蚁群算法蚂蚁一次周游的质量。针对旅游路线规划的问题,改进了路径的求法,使蚁群算法可以实现动态规划,从而实现旅游景区的负载均衡。提出一种基于改进蚁群算法的旅游路线规划问题求解的有效方法。实验结果表明该方法具有较好的有效性和实用性。

CLC Number: