A heuristic method for the open vehicle routing problem

Authors
Sariklis, D Powell, S
Citation
D. Sariklis et S. Powell, A heuristic method for the open vehicle routing problem, J OPER RES, 51(5), 2000, pp. 564-573
Citations number
14
Categorie Soggetti
Management,"Engineering Mathematics
Journal title
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
ISSN journal
01605682 → ACNP
Volume
51
Issue
5
Year of publication
2000
Pages
564 - 573
Database
ISI
SICI code
0160-5682(200005)51:5<564:AHMFTO>2.0.ZU;2-B
Abstract
The open vehicle routing problem (OVRP) differs from the classic vehicle ro uting problem (VRP) because the vehicles either are not required to return to the depot, or they have to return by revisiting the customers assigned t o them in the reverse order. Therefore, the vehicle routes are not closed p aths but open ones. A heuristic method for solving this new problem, based on a minimum spanning tree with penalties procedure, is presented. Computat ional results are provided.