Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (4): 16-19.DOI: 10.3778/j.issn.1002-8331.2009.04.005

• 博士论坛 • Previous Articles     Next Articles

Hybrid improved ant algorithm for vehicle routing problem with time windows

CUI Xue-li1,ZHU Dao-li2   

  1. 1.College of Economy and Management,Suzhou University of Science and Technology,Suzhou,Jiangsu 215009,China
    2.College of Management,Fudan University,Shanghai 200433,China
  • Received:2008-05-13 Revised:2008-11-04 Online:2009-02-01 Published:2009-02-01
  • Contact: CUI Xue-li



  1. 1.苏州科技学院 经济与管理学院,江苏 苏州 215009
    2.复旦大学 管理学院,上海 200433
  • 通讯作者: 崔雪丽

Abstract: Vehicle Routing Problem with Time Windows(VRPTW) is a very important extended type of Vehicle Routing Problem(VRP).Based on the idea of ant colony optimization,a hybrid improved ant algorithm for solving this problem is designed and some Solomon instances are solved.Computational experiments are tested and the results are compared with some other heuristic methods which is promising in good performances.

Key words: Vehicle Routing Problem with Time Windows(VRPTW), hybrid ant algorithm, transition probability amending

摘要: 带时间窗车辆路径问题(VRPTW)是VRP的一种重要扩展类型,在蚂蚁算法思想基础上,设计用于求解该问题的混合改进型算法并求解Solomon标准数据库中的大量实例。经过大量数据测试并与其他启发式算法所得结果进行比较,获得了较好的效果。

关键词: 带时间窗车辆路径问题, 混合蚂蚁算法, 转移概率修正