Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tarantilis, C.D.: Solving the vehicle routing problem with adaptive memory programming methodology. Comput. Oper. Res. 32, 2309–2327 (2005)
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)
Bräysy, O., Dullaert, W., Gendreau, M.: Evolutionary algorithms for the Vehicle Routing Problem with Time Windows. J. Heuristics 10, 587–611 (2004)
Bräysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows Part I: Route construction and local search algorithms. Trans. Sci. 39, 104–118 (2005)
Bräysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows Part II: Metaheuristics. Trans. Sci. 39, 119–139 (2005)
Gendreau, M., Potvin, J.-Y.: Metaheuristics in Combinatorial Optimization. Anns. Opns. Res. 40, 189–213 (2005)
Bräysy, O., Hasle, G., Dullaert, W.: A multi start local search algorithm for the vehicle routing problem with time windows. Eur. J. Opl. Res. 159, 586–605 (2005)
Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Trans. Sci. 38, 515–530 (2004)
Le Bouthillier, A., Crainic, T.G., Kropf, P.: A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows. IEEE Intelligent Sys. 20, 36–42 (2005)
Russell, R.A., Chiang, W.-C.: Scatter search for the vehicle routing problem with time windows. Eur. J. Opl. Res. 169, 606–622 (2006)
Ibaraki, T., Imahori, S., Kudo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithms for routing and scheduling problems with general time window constraints. Trans. Sci. 39, 206–232 (2005)
Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glb. Opt. 6, 109–154 (1995)
Bräysy, O.: A Reactive Variable Neighborhood Search for the Vehicle Routing Problem with Time Windows. INFORMS J. Comp. 15, 347–368 (2003)
Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. Eur. J. Opl. Res. 130, 449–467 (2002)
Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533–549 (1986)
Ioannou, G., Kritikos, M., Prastacos, G.: A greedy look-ahead heuristic for the vehicle routing problem with time windows. J. Oper. Res. Soc. 52, 523–537 (2001)
Kontoravdis, G., Bard, J.F.: A GRASP for the vehicle routing problem with time windows. ORSA J. Comp. 7, 10–23 (1995)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Opns. Res. 35, 254–265 (1987)
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)
Prais, M., Rideiro, C.C.: Parameter variation in GRASP procedures. Investigación Operativa 9, 1–20 (2000)
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)
Homberger, J., Gehring, H.: A two phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Opl. Res. 162, 449–467 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Repoussis, P.P., Paraskevopoulos, D.C., Tarantilis, C.D., Ioannou, G. (2006). A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows. In: Almeida, F., et al. Hybrid Metaheuristics. HM 2006. Lecture Notes in Computer Science, vol 4030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890584_10
Download citation
DOI: https://doi.org/10.1007/11890584_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46384-9
Online ISBN: 978-3-540-46385-6
eBook Packages: Computer ScienceComputer Science (R0)