Neighborhood Reduction in Local Search based on Geospatial Relation for Multi Depot Vehicle Routing Problems

This paper proposes neighborhood reduction techniques in local search of the customer decomposition subproblem in the Multi Depots Vehicle Routing Problem with Time Windows (MDVRPTW) by using geospatial relation among depots and customers. The neighborhood of the customer decomposition subproblem can be simply and well defined but it should include excessively bad solution candidates. Our techniques find such candidates by using information of the problem domain, geographical relation. We use our techniques in Tabu Search and evaluate the effectiveness in computer experiment.