Skip to main content

Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4771)

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.

Keywords

  • Vehicle Routing Problems with Time Windows
  • Coefficient Weighted Distance Time Heuristics
  • Iterated Local Search
  • Simulated Annealing

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-75514-2_3
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   69.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-75514-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   89.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Google Scholar 

  2. Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Windows Constraints. Operations Research 35, 254–265 (1987)

    MATH  MathSciNet  CrossRef  Google Scholar 

  3. Laporte, G.: The Vehicle Routing Problem: An Overview of Exact and Approximative Algorithms. European Journal of Operational Research 59, 345–358 (1992)

    MATH  CrossRef  Google Scholar 

  4. 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)

    CrossRef  Google Scholar 

  5. Bräysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows Part II: Metaheuristics. Trans. Sci. 39, 119–139 (2005)

    CrossRef  Google Scholar 

  6. 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)

    CrossRef  Google Scholar 

  7. 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)

    Google Scholar 

  8. Osman, I.: Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problems. Annals of Operation Research 41, 421–451 (1993)

    MATH  CrossRef  Google Scholar 

  9. 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)

    Google Scholar 

  10. Hoos, H., Sttzle, T.: Stochastic Local Search: Foundation and Application. Morgan Kauffman, San Francisco (2005)

    Google Scholar 

  11. Laurenço, H.R., Serra, D.: Adaptive search heuristics for the generalized assignment problem. Mathware & Soft Computing 9(2-3), 209–234 (2002)

    MathSciNet  Google Scholar 

  12. Kirkpatrick, S., Gelatt, C.D., Vecchi Jr., M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)

    CrossRef  MathSciNet  Google Scholar 

  13. Cerny, V.: A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm. Journal of Optimization Theory and Applications 45, 41–51 (1985)

    MATH  CrossRef  MathSciNet  Google Scholar 

  14. 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)

    CrossRef  Google Scholar 

  15. 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)

    MATH  CrossRef  Google Scholar 

  16. Le Bouthillier, A., Crainic, T.G.: Cooperative parallel method for vehicle routing problems with time windows. Computers and Operations Research 32, 1685–1708 (2005)

    MATH  CrossRef  Google Scholar 

  17. Pisinger, D., Röpke, S.: A general heuristic for vehicle routing problems. Technical Report, Department of Computer Science, University of Copenhagen (2005)

    Google Scholar 

  18. 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)

    CrossRef  Google Scholar 

  19. Reinholz, A.: Ein statistischer Test zur Leistungsbewertung von iterativen Variationsverfahren. Technical Report 03027, SFB559, University of Dortmund (2003) (in German)

    Google Scholar 

  20. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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: , 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)