A reactive tabu search metaheuristic for the vehicle routing problem with time windows

A reactive tabu search metaheuristic for the vehicle routing problem with time windows

0.00 Avg rating0 Votes
Article ID: iaor1999201
Country: United States
Volume: 9
Issue: 4
Start Page Number: 417
End Page Number: 430
Publication Date: Sep 1997
Journal: INFORMS Journal On Computing
Authors: ,
Keywords: optimization, heuristics
Abstract:

This article develops a reactive tabu search metaheuristic for the vehicle routing and scheduling problem with time window constraints. Reactive tabu search dynamically varies the size of the list of forbidden moves to avoid cycles as well as an overly constrained search path. Intensification and diversification strategies are examined as ways to achieve higher quality solutions. The λ-interchange mechanism of Osman is used as the neighborhood structure for the search process. Computational results on test problems from the literature as well as large-scale real-world problems are reported. The metaheuristic achieves solutions that compare favorably with previously reported results.

Reviews

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