A unified tabu search heuristic for vehicle routing problems with time windows

A unified tabu search heuristic for vehicle routing problems with time windows

0.00 Avg rating0 Votes
Article ID: iaor20021218
Country: United Kingdom
Volume: 52
Issue: 8
Start Page Number: 928
End Page Number: 936
Publication Date: Aug 2001
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: tabu search
Abstract:

This paper presents a unified tabu search heuristic for the vehicle routing problem with time windows and for two important generalizations: the periodic and the multi-depot vehicle routing problems with time windows. The major benefits of the approach are its speed, simplicity and flexibility. The performance of the heuristic is assessed by comparing it to alternative methods on benchmark instances of the vehicle routing problem with time windows. Computational experiments are also reported on new randomly generated instances for each of the two generalizations.

Reviews

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