This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. By using an appropriate graph representation, and then a graph extension, the problems are transformed into equivalent constrained assignment problems. Optimal solutions are then found by means of a branch and bound tree. Problems involving up to 80 nodes can be solved without difficulty.
No takes yet. Share an insight, caveat, or question.
Laporte et al. (1988) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: