Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/68206
Title: A new tabu search heuristic for the open vehicle routing problem
Authors: Fu, Z
Eglese, RW
Li, LYO 
Keywords: Vehicle routing
Open vehicle routing problem
Tabu search
Distribution management
Issue Date: 2005
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2005, v. 56, no. 3, p. 267-274 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: In this paper, another version 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, 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.
URI: http://hdl.handle.net/10397/68206
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/palgrave.jors.2601817
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

81
Citations as of Oct 17, 2017

WEB OF SCIENCETM
Citations

66
Last Week
0
Last month
Citations as of Oct 17, 2017

Page view(s)

21
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.