An exchange heuristic for routeing problems with time windows

An exchange heuristic for routeing problems with time windows

0.00 Avg rating0 Votes
Article ID: iaor19962067
Country: United Kingdom
Volume: 46
Issue: 12
Start Page Number: 1433
End Page Number: 1446
Publication Date: Dec 1995
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: heuristics
Abstract:

This paper compares different exchange heuristics for vehicle routeing problems with time windows. It also introduces a new 2-opt* exchange heuristic, and shows that a hybrid approach, based on Or-opt and 2-opt* exchanges, is particularly powerful for problems with time windows. Computational results are reported for randomly generated problems and for a standard test set.

Reviews

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