TY - UNPB

T1 - A tabu search heuristic for the open vehicle routing problem

AU - Li, L Y O

AU - Eglese, R W

AU - Fu, Z

PY - 2003

Y1 - 2003

N2 - In this paper another kind of the vehicle routing problem (VRP) ¾ the open vehicle routing problem (OVRP) is studied, in which the vehicles are not required to return to the depot, or if they are required to do so 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 solution. The computational results are provided and compared with two other methods in the literature

AB - In this paper another kind of the vehicle routing problem (VRP) ¾ the open vehicle routing problem (OVRP) is studied, in which the vehicles are not required to return to the depot, or if they are required to do so 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 solution. The computational results are provided and compared with two other methods in the literature

KW - vehicle routing

KW - open vehicle routing problem

KW - tabu search

KW - distribution management

M3 - Working paper

T3 - Management Science Working Paper Series

BT - A tabu search heuristic for the open vehicle routing problem

PB - The Department of Management Science

CY - Lancaster University

ER -