The Vehicle Routing Problem with Time Windows Part I: Tabu Search

Published Online:https://doi.org/10.1287/ijoc.8.2.158

This paper describes a tabu search heuristic for the vehicle routing problem with time windows. The tabu search is based on specialized local search heuristics that maintain the feasibility of the solution at all time. Computational results on a standard set of test problems are reported, as well as comparisons with other heuristics.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.