| Article ID: | iaor20107536 |
| Volume: | 180 |
| Issue: | 1 |
| Start Page Number: | 125 |
| End Page Number: | 144 |
| Publication Date: | Nov 2010 |
| Journal: | Annals of Operations Research |
| Authors: | Brando de Oliveira Csar, Vasconcelos Crispim |
| Keywords: | time windows |
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.