Hybrid ant colony system algorithm for the vehicle routing problem with dynamic customers and traffic factors

A recent research showed that the Ant Colony System (ACS) algorithm hybridized with the Large Neighborhood Search (LNS) algorithm perform well on the Vehicle Routing Problem (VRP) in the dynamic environment. In this paper, we address this hybridization for this problem with traffic factors, which takes into account the variation of the travel cost between two locations. The main goal of this work is to minimize the total cost in the vehicle routing problem with dynamic requests and traffic factors using a hybridized ant colony system algorithm.