A new tabu search heuristic for the open vehicle routing problem

A new tabu search heuristic for the open vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor20062101
Country: United Kingdom
Volume: 56
Issue: 3
Start Page Number: 267
End Page Number: 274
Publication Date: Mar 2005
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: heuristics
Abstract:

In this paper, another version of the vehicle routing problem – the open vehicle routing problem – is studied in which the vehicles are not required to return to the depot, but if they do, it must be by revisiting the customers assigned to them in the reverse order. By exploiting the special structure of this type of problem, we present a new tabu search heuristic for finding the routes that minimize two objectives while satisfying three constraints. The computational results are provided and compared with two other methods in the literature.

Reviews

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