This paper considers a version of the vehicle routing problem in which all vehicles are identical and where the distance travelled by any vehicle may not exceed a prespecified upper bound. The problem is first formulated as an integer program which is solved by means of a constraint relaxation procedure. Two exact algorithms are developed: one based on Gomory cutting planes and one on branch and bound. Numerical results are reported.
No takes yet. Share an insight, caveat, or question.
Laporte et al. (1984) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: