An Ant Colony Optimization Algorithm for a Site-Dependent Vehicle Routing Problem with Maximum Tour Time Length

Traffic inhibitory rules are one of the strategies applied in traffic control, especially in capital cities with large amount of daily transportation. "Traffic plan" and "even-odd traffic plan" are such of these strategies implemented in some large cities such as Tehran. Based on these traffic inhibitory rules, transportation in some crowded regions would be prohibited. Considering traffic plan limitation in vehicle routing problem, turns this problem in to a sitedependent vehicle routing problem. At first, in this paper, we consider this limitation as a site-dependency assumption in the problem and then we present the Mixed Integer Programming model of the problem in which each vehicle, depending on its type, has a maximum tour time length.. Secondly, an Ant Colony Optimization-based algorithm is presented for the problem. This presented algorithm has become more explorative via local searches. Finally, some test problems are solved and analyzed in both small and large.