A threshold accepting metaheuristic for the vehicle routing problem with time windows

A threshold accepting metaheuristic for the vehicle routing problem with time windows

0.00 Avg rating0 Votes
Article ID: iaor2006821
Country: Germany
Volume: 11
Issue: 4
Start Page Number: 369
End Page Number: 387
Publication Date: Dec 2003
Journal: Central European Journal of Operations Research
Authors: , , ,
Keywords: heuristics, optimization: simulated annealing
Abstract:

Threshold Accepting, a variant of Simulated Annealing, is applied for the first time to a set of 356 benchmark instances for the Vehicle Routing with Time Windows. The Threshold Accepting metaheuristic is used to improve upon results obtained with a recent parallel genetic algorithm and a multi-start local search to illustrate its value as a post-processor. The Threshold Accepting metaheuristic is shown to be a fast and versatile post-processor that can be imposed upon a variety of heuristic or metaheuristic approaches for vehicle routing to get better results in both theoretical and practical applications.

Reviews

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