In this paper, we discuss a computationally viable algorithm based on a set‐partitioning for‐mulation of the Vehicle Routing Problem (VRP). Implementation strategies based on theoretical as well as empirical results are developed. Some computational results are presented. It is shown that a set‐partitioning formulation to the VRP, although well known for a long time, deserves considerable research efforts beyond those we present here.
No takes yet. Share an insight, caveat, or question.
Agarwal et al. (1989) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: