A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows

摘要: This paper presents a hybrid metaheuristic to address the vehicle routing problem with time windows (VRPTW). The VRPTW can be described as of designing least cost routes from depot geographically dispersed customers. must designed such that each customer is visited only once by exactly one without violating capacity and window constraints. proposed solution method multi-start local search approach which combines reactively systematic diversification mechanisms Greedy Randomized Adaptive Search Procedures novel Variable Neighborhood Tabu for intensification search. Experimental results on well known benchmark instances show suggested both efficient robust in terms quality solutions produced.