Dynamic vehicle routing problem using hybrid ant system

The dynamic vehicle routing problem, DVRP, consists in optimally routing a fleet occur at random. The optimization consists in finding the solution that minimizes the total length of tours and satisfying the customer delivery time window. In this paper, we present a hybrid ant system to handle the dynamism by means of modifying the pheromone matrix and candidate sets strategy. In addition, we make further improvements on vehicle routes with the local search heuristics. The results show that the hybrid ant system works effectively to find competitive solutions.