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.