A Tabu Search Approach combined with An Extended Saving Me- thod for Multi-depot Vehicle Routing Problems with Time Windows

This paper presents a Tabu Search approach combined with extended saving method for Multi-depot Vehicle Routing Problems with Time Window. The problem can be divided into two sub problems; the customer assignment problem and the k single-depot vehicle routing problems, where k is the number of depots. For the former problem, we propose an tabu search approach in which neighborhood reduction can be effectively performed while keeping solution quality. For the latter problem, we extend the well-known saving method to treat new constraints. By computer ex- periments, we confirm the effectiveness of our proposed method.