Simulated annealing metaheuristics for the vehicle routing problem with time windows

This paper develops simulated annealing metaheuristics for the vehicle routing and scheduling problem with time window constraints. Two different neighborhood structures, the ii-interchange mechanism of Osman and the k-node interchange process of Christofides and Beasley, are implemented. The enhancement of the annealing process with a short-term memory function via a tabu list is examined as a basis for improving the metaheuristic approach. Computational results on test problems from the literature as well as large-scale real-world problems are reported. The metaheuristics achieve solutions that compare favorably with previously reported results.