Simulated annealing metaheuristics for the vehicle routing problem with time windows

Simulated annealing metaheuristics for the vehicle routing problem with time windows

0.00 Avg rating0 Votes
Article ID: iaor19971380
Country: Netherlands
Volume: 63
Issue: 1
Start Page Number: 3
End Page Number: 27
Publication Date: May 1996
Journal: Annals of Operations Research
Authors: ,
Keywords: optimization: simulated annealing, combinatorial analysis
Abstract:

This paper develops simulated annealing metaheuristics for the vehicle routing and scheduling problem with time window constraints. Two different neighborhood structures, the λ-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.

Reviews

Required fields are marked *. Your email address will not be published.