The Euclidean Vehicle Routing Problem With Multiple Depots And Time Windows

This paper studies the Euclidean vehicle routing problem with multiple depots and time windows (Euclidean VRP with MDTW). We consider the scenario where there are multiple depots which could dispatch out vehicles, and customers must be serviced within a time window which is chosen from a finite set of consecutive time windows. Specially, in an input instance of Euclidean VRP with MDTW, we require that each customer has the same unit demand, ignore the limit of vehicle number, and give a reasonable service ability to the servicing vehicles. In quasi-polynomial time, our algorithm could generate a solution with the expected length at most (1 + O(epsilon))OPT.