The open vehicle routing problem (OVRP) differs from the classic vehicle routing problem (VRP) because the vehicles either are not required to return to the depot, or they have to return by revisiting the customers assigned to them in the reverse order. Therefore, the vehicle routes are not closed paths but open ones. A heuristic method for solving this new problem, based on a minimum spanning tree with penalties procedure, is presented. Computational results are provided.
No takes yet. Share an insight, caveat, or question.
Sariklis et al. (2000) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: