Annals of Operations Research

, Volume 180, Issue 1, pp 125–144

A hybrid search method for the vehicle routing problem with time windows

  • Humberto César Brandão de Oliveira
  • Germano Crispim Vasconcelos

DOI: 10.1007/s10479-008-0487-y

Cite this article as:
Brandão de Oliveira, H.C. & Vasconcelos, G.C. Ann Oper Res (2010) 180: 125. doi:10.1007/s10479-008-0487-y


Vehicle Routing Problems have been extensively analyzed to reduce transportation costs. More particularly, the Vehicle Routing Problem with Time Windows (VRPTW) imposes the period of time of customer availability as a constraint, a common characteristic in real world situations. Using minimization of the total distance as the main objective to be fulfilled, this work implements an efficient algorithm which associates non-monotonic Simulated Annealing to Hill-Climbing and Random Restart. The algorithm is compared to the best results published in the literature for the 56 Solomon instances and it is shown how statistical methods can be used to boost the performance of the method.


Vehicle routing problemsHybrid systemsOptimizationSimulated annealing

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Humberto César Brandão de Oliveira
    • 1
  • Germano Crispim Vasconcelos
    • 2
  1. 1.Department of Exact SciencesFederal University of AlfenasAlfenasBrazil
  2. 2.Center for InformaticsFederal University of PernambucoRecifeBrazil