Abstract
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Windows. Both hybrid Metaheuristics are based on the same neighborhood generating operators and local search procedures. The initial solutions are obtained by the Coefficient Weighted Distance Time Heuristics with automated parameter tuning. The strategies are compared in an empirical study on four real-world problems. A performance measure is used that also considers multiple restarts of the algorithms.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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, pp. 157–193. SIAM Publishing, Philadelphia (2002)
Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Windows Constraints. Operations Research 35, 254–265 (1987)
Laporte, G.: The Vehicle Routing Problem: An Overview of Exact and Approximative Algorithms. European Journal of Operational Research 59, 345–358 (1992)
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)
Bräysy, O., Dullaert, W.: A Fast Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows. International Journal on Artificial Intelligence Tools 12(2), 153–173 (2003)
Reinholz, A.: A Hybrid (1+1)-Evolutionary Algorithm for Periodic and Multiple Depot Vehicle Routing Problems. In: Proceedings on CD. The 6th Metaheuristics International Conference, University of Vienna, Department of Business Administration, Vienna, Austria, August 22-26, 2005, pp. 793–798 (2005)
Osman, I.: Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problems. Annals of Operation Research 41, 421–451 (1993)
Galić, A., Carić, T., Fosin, J., Ćavar, I., Gold, H.: Distributed Solving of the VRPTW with Coefficient Weighted Time Distance and Lambda Local Search Heuristics. In: Biljanović, P., Skala, K. (eds.) Proceedings of the 29th International Convention MIPRO, MIPRO, Rijeka, pp. 247–252 (2006)
Hoos, H., Sttzle, T.: Stochastic Local Search: Foundation and Application. Morgan Kauffman, San Francisco (2005)
Laurenço, H.R., Serra, D.: Adaptive search heuristics for the generalized assignment problem. Mathware & Soft Computing 9(2-3), 209–234 (2002)
Kirkpatrick, S., Gelatt, C.D., Vecchi Jr., M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)
Cerny, V.: A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm. Journal of Optimization Theory and Applications 45, 41–51 (1985)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H.: Equations of State Calculations by Fast Computing Machines. The Journals of Chemical Physics 21, 1087–1092 (1953)
Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162, 220–238 (2005)
Le Bouthillier, A., Crainic, T.G.: Cooperative parallel method for vehicle routing problems with time windows. Computers and Operations Research 32, 1685–1708 (2005)
Pisinger, D., Röpke, S.: A general heuristic for vehicle routing problems. Technical Report, Department of Computer Science, University of Copenhagen (2005)
Mester, D., Bräysy, O., Dullaert, W.: A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Systems with Applications 32, 508–517 (2007)
Reinholz, A.: Ein statistischer Test zur Leistungsbewertung von iterativen Variationsverfahren. Technical Report 03027, SFB559, University of Dortmund (2003) (in German)
Galić, A., Carić, T., Gold, H.: MARS - A Programming Language for Solving Vehicle Routing Problems. In: Taniguchi, E., Thompson, R. (eds.) Recent Advances in City Logistics, pp. 48–57. Elsevier, Amsterdam (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carić, T., Fosin, J., Galić, A., Gold, H., Reinholz, A. (2007). Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems. In: Bartz-Beielstein, T., et al. Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, vol 4771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75514-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-75514-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75513-5
Online ISBN: 978-3-540-75514-2
eBook Packages: Computer ScienceComputer Science (R0)