Application and Research on Vehicle Routing Problem with Time Window Based on Dynamic Adaptive Ant Colony Algorithm

摘要：

Ant Colony Algorithm(ACO)has much more advantages in solving Vehicle Routing Problem with Time Window(VRPTW). However, with the increasing scale of the problem, ACO algorithm is liable to present some defects such as the long searching time and the high possibility of stagnation. To avoid these problems and solve the multi-objectives VRPTW problem, a new dynamic adaptive ACO algorithm which makes probability of the transfer and pheromone gene adapt to the searching process for optimality automatically is proposed in this paper. Simulation results show the adaptive ACO is very effective in solving VRPTW problem.

关键词： VRPTW ACO adaptation pheromone gene transfer probability

作者: Wang Hongling He Yueshun Zheng Gang

作者单位: East China Institute of Technology Nanchang .China East China Institute of Technology Nanchang ,China East China Institute of Technology Nanchang,China

会议类型: 国际会议

会议名称: The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

会议地点: 太原

会议语种:英文

页码: 8-12

在线出版日期: 2010-10-22（万方平台首次上网日期，不代表论文的发表时间）