Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (31): 28-31.DOI: 10.3778/j.issn.1002-8331.2010.31.008

• 博士论坛 • Previous Articles     Next Articles

Hybrid ant colony algorithm for vehicle routing problem with multiple time windows

PENG Bi-tao1,2,ZHOU Yong-wu1   

  1. 1.School of Business Administration,South China University of Technology,Guangzhou 510641,China
    2.School of Informatics,Guangdong University of Foreign Studies,Guangzhou 510006,China
  • Received:2010-07-28 Revised:2010-09-29 Online:2010-11-01 Published:2010-11-01
  • Contact: PENG Bi-tao



  1. 1.华南理工大学 管理学院,广州 510641
    2.广东外语外贸大学 信息学院,广州 510006
  • 通讯作者: 彭碧涛

Abstract: Vehicle routing problem with multiple time windows(VRPMTW) is studied in this paper.The mathematical model is built,and a heuristic algorithm based on hybrid ant algorithm is designed.It uses ant algorithm to obtain the initial solution,and uses 2-opt and cellular model to improve the initial solution,and imports the mutate operator.Experiment results show that the algorithm can solve the VRPMTW efficiently.

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

摘要: 研究了多时间窗车辆路径问题,建立了多时间窗车辆路径问题的数学模型,并基于蚁群算法设计了一种混合蚁群算法对问题进行了求解。该算法首先利用基本蚁群算法求解,然后采用2-opt算法和元胞自动算法对结果进行优化,同时加入变异算子。实验结果表明该算法可以有效地求解多时间窗车辆路径问题。

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

CLC Number: