• 论文 •    

改进的最大-最小蚂蚁算法在有时间窗车辆路径问题中的应用

万  旭, 林健良, 杨晓伟   

  1. 华南理工大学 应用数学系, 广东  广州  510640
  • 出版日期:2005-04-15 发布日期:2005-04-25

Improved MMAS for vehicle routing problem with time window

WAN Xu , LIN Jian-liang , YANG Xiao-wei   

  1. Dep. of Applied Mathematics,South China Univ. of Tech.,Guangzhou  510640,China
  • Online:2005-04-15 Published:2005-04-25

摘要: 利用最大-最小策略,最大最小蚂蚁算法减小了蚂蚁算法陷入局部陷阱的可能性。基于对最大最小信息素策略和信息素更新方式的改进,结合快速产生初始解的算法,提出了一种新方法。把该方法应用于有时间窗车辆路径问题,试验结果表明该算法是有效的。

关键词: 蚂蚁算法, 车辆路径问题, 时间窗

Abstract: Max-Min Ant System (MMAS) reduced the possibility of ant system being dropped into the local trap via Max-Min strategy. By improved Max-Min pheromone strategy and the way of updating pheromone,an improved algorithm was proposed by based on the traditional algorithm which gave initial results fast. The proposed algorithm was applied to the Vehicle Routing Problem with Time Window(VRPTW). The experiment results indicates that the new algorithm is effective.

Key words: ant system, vehicle routing problem, time window

中图分类号: