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.
Dynamic vehicle routing problem using hybrid ant system
2003-01-01
325521 byte
Conference paper
Electronic Resource
English
Dynamic Vehicle Routing Problem Using Hybrid Ant System
British Library Conference Proceedings | 2003
|Dynamic Vehicle Routing Problem with Multiple Objectives
Transportation Research Record | 2005
|DataCite | 2024
|