Abstract
We are given a complete and loop-free digraphG=(V, A), whereV={1,...,n} is the vertex set,A={(i, j) :i, j ∈V} the arc set, andr ∈V is a distinguishedroot vertex. For each arc (i, j) ∈A, letc ij be the associatedcost, and for each vertexi, letq i ≥0 be the associateddemand (withq r =0). Moreover, a nonnegativebranch capacity, Q, is defined.A Capacitated Shortest Spanning Arborescence rooted at r (CSSA r ) is a minimum cost partial digraph such that: (i) each vertexj ≠r has exactly one entering arc; (ii) for each vertexj ≠r, a path fromr toj exists; (iii) for each branch leaving vertexr, the total demand of the vertices does not exceed the branch capacity,Q. A variant of theCSSA r problem (calledD-CSSA r ) arises when the out-degree of the root vertex is constrained to be equal to a given valueD. These problems are strongly NP-hard, and find practical applications in routing and network design. We describe a new Lagrangian lower bound forCSSA r andD-CSSA r problems, strengthened in a cutting plane fashion by iteratively adding violated constraints to the Lagrangian problem. We also present a new lower bound based on projection leading to the solution of min-cost flow problems. The two lower bounds are then combined so as to obtain an overall additive lower bounding procedure. The additive procedure is then imbedded in a branch-and-bound algorithm whose performance is enhanced by means of reduction procedures, dominance criteria, feasibility checks and upper bounding. Computational tests on asymmetric and symmetric instances from the literature, involving up to 200 vertices, are given, showing the effectiveness of the proposed approach.
Similar content being viewed by others
References
R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows (Prentice-Hall, 1993).
M. Bellmore and J.C. Malone, Pathology of travelling salesman subtour-elimination algorithms, Operations Research 19(1971)278–307.
G. Carpaneto, M. Dell'Amico, M. Fischetti and P. Toth, A branch and bound algorithm for the multiple depot vehicle scheduling problem, Networks 19(1989)531–548.
G. Carpaneto, M. Fischetti and P. Toth, New lower bounds for the symmetric travelling salesman problem, Mathematical Programming 45(1989)233–254.
K.M. Chandy and T. Lo, The capacitated minimum spanning tree, Networks 3(1973)173–182.
J. Edmonds, Optimum branching, J. Res. Nat. Bur. Standards 71B(1967)233–240.
D. Elias and M.J. Ferguson, Topological design of multipoint teleprocessing networks, IEEE Transactions on Communications COM-22(1974)1753–1762.
M. Fischetti and P. Toth, An additive approach for the optimal solution of the prize-collecting travelling salesman problem, in:Vehicle Routing: Methods and Studies, eds. B.L. Golden and A.A. Assad (North-Holland, Amsterdam, 1988).
M. Fischetti and P. Toth, A new dominance procedure for combinatorial optimization problems, Operations Research Letters 7(1988)181–187.
M. Fischetti and P. Toth, An Additive Bounding Procedure for Combinatorial Optimization Problems, Operations Research 37(1989)319–328.
M. Fischetti and P. Toth, An additive bounding procedure for the asymmetric travelling salesman problem, Mathematical Programming 53(1992)173–197.
M. Fischetti and P. Toth, An efficient algorithm for the min-sum arborescence problem on complete digraphs, ORSA Journal on Computing 5(1993)426–434.
M. Fischetti, P. Toth and D. Vigo, A branch and bound algorithm for the capacitated vehicle routing problem on directed graphs, Operations Research 42(1994)846–859.
M.L. Fisher, Optimal solution of vehicle routing problems using minimumk-trees, Operations Research 42(1994)626–642.
H.N. Gabow and R.E. Tarjan, Efficient algorithms for a family of matroid intersection problems, Journal of Algorithms 5(1984)80–131.
B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, Journal of the Association for Computing Machinery 30(1983)118–132.
A. Kershenbaum, Computing capacitated minimal spanning trees efficiently, Networks 4(1974)299–310.
M. Held and R.M. Karp, The travelling salesman problem and minimum spanning trees, Operations Research 18(1970)1138–1162.
M. Held and R.M. Karp, The travelling salesman problem and minimum spanning trees: Part II, Mathematical Programming 1(1971)6–25.
S. Martello and P. Toth,Knapsack Problems: Algorithms and Computer Implementations (Wiley, Chichester, 1990).
K. Malik and G. Yu, A branch and bound algorithm for the capacitated minimum spanning tree problem, Networks 23(1993)525–532.
C.H. Papadimitriou, The complexity of the capacitated tree problem, Networks 8(1978)217–230.
R.E. Tarjan, Finding optimum branchings, Networks 7(1977)25–35.
P. Toth and D. Vigo, An exact algorithm for the vehicle routing problem with backhauls, Research Report, DEIS OR/93/5, University of Bologna (1993).
G. Yu and M.L. Fisher, A Lagrangian optimization algorithm for the asymmetric non-uniform fleet vehicle routing problem, Working Paper 89-03-10, Decision Science Department, The Wharton School, University of Pennsylvania (1989).
D. Vigo, A heuristic algorithm for the asymmetric capacitated vehicle routing problem, European Journal of Operational Research, to appear.
G. Laporte, H. Mercure and Y. Nobert, An exact algorithm for the asymmetrical capacitated vehicle routing problem, Networks 16(1986)33–46.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Toth, P., Vigo, D. An exact algorithm for the capacitated shortest spanning arborescence. Ann Oper Res 61, 121–141 (1995). https://doi.org/10.1007/BF02098285
Issue Date:
DOI: https://doi.org/10.1007/BF02098285