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 the problem of designing least cost routes from a depot to geographically dispersed customers. The routes must be designed such that each customer is visited only once by exactly one vehicle without violating capacity and time window constraints. The proposed solution method is a multi-start local search approach which combines reactively the systematic diversification mechanisms of Greedy Randomized Adaptive Search Procedures with a novel Variable Neighborhood Tabu Search hybrid metaheuristic for intensification search. Experimental results on well known benchmark instances show that the suggested method is both efficient and robust in terms of the quality of the solutions produced.
KeywordsLocal Search Tabu Search Greedy Randomize Adaptive Search Procedure Vehicle Route Problem Tabu List
Unable to display preview. Download preview PDF.
- 2.Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F.: The Vehicle Routing Problem with Time Windows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, SIAM Publishing, Philadelphia (2002)Google Scholar
- 19.Bräysy, O.: Local search and variable neighborhood Search Algorithms for the Vehicle Routing Problem with Time Windows, Technical Report, Acta Wasaensia 87, University Wasaenis, Vaasa (2001)Google Scholar
- 20.Prais, M., Rideiro, C.C.: Parameter variation in GRASP procedures. Investigación Operativa 9, 1–20 (2000)Google Scholar
- 21.Berger, J., Barkaoui, M., Braysy, O.: A route directed hybrid genetic approach for the vehicle routing problem with time windows. Inform. Systems Oper. Res. 41, 179–194 (2003)Google Scholar