AboutSign inJoin
A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows

A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows

Jean-Yves Potvin, Université de Montréal. Centre de recherche sur les transports, Tanguy Kervahut, Jean-Marc Rousseau, Centre for Research on Transportation (Montréal, Québec) — 1993
This paper describes a tabu search heuristic for the vehicle routing problem with time windows (VRPTW). The tabu search incorporates an exchange heuristic which is specifically designed for problems with time windows. Computational results on the standard set of problems of Solomon are included at the end of the paper.
Sign up to use