A tabu search heuristic for the open vehicle routing problem

Li, L Y O and Eglese, R W and Fu, Z (2003) A tabu search heuristic for the open vehicle routing problem. Working Paper. The Department of Management Science, Lancaster University.

Full text not available from this repository.


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

Item Type: Monograph (Working Paper)
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Departments: Lancaster University Management School > Management Science
ID Code: 48650
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 21:04
Refereed?: No
Published?: Published
Last Modified: 25 Nov 2019 03:52
URI: https://eprints.lancs.ac.uk/id/eprint/48650

Actions (login required)

View Item View Item