Skip to main content
SpringerLink
Log in

A fast heuristic algorithm for the maximum concurrent k-splittable flow problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we propose a fast heuristic algorithm for the maximum concurrent k-splittable flow problem. In such an optimization problem, one is concerned with maximizing the routable demand fraction across a capacitated network, given a set of commodities and a constant k expressing the number of paths that can be used at most to route flows for each commodity. Starting from known results on the k-splittable flow problem, we design an algorithm based on a multistart randomized scheme which exploits an adapted extension of the augmenting path algorithm to produce starting solutions for our problem, which are then enhanced by means of an iterative improvement routine. The proposed algorithm has been tested on several sets of instances, and the results of an extensive experimental analysis are provided in association with a comparison to the results obtained by a different heuristic approach and an exact algorithm based on branch and bound rules.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory Algorithms and Applications. Prentice Hall Inc., Englewood Cliffs (1993)

    Google Scholar 

  2. Albrecht C.: Global routing by new approximation algorithms for multicommodity flow. IEEE Trans. Comput. Aided Des. Integr. Circuit Syst. 20, 622–632 (2001)

    Article  Google Scholar 

  3. Andrews, M., Zhang, L.: Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (2005)

  4. Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pp. 15–29 (2001)

  5. Badics, T.: GENRMF. (1991). ftp://dimacs.rutgers.edu/pub/netflow/generators/network/genrmf/

  6. Bienstock D., Raskina O.: Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Program. Ser. B 91, 479–492 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Baier G., Köhler E., Skutella M.: On the k-splittable flow problem. Algorithmica 42, 231–248 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Caramia M., Sgalambro A.: An exact approach for the maximum concurrent k-splittable flow problem. Optim. Lett. 2(2), 251–265 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Caramia M., Sgalambro A.: On the approximation of the single source k-splittable flow problem. J. Discrete Algorithms 6(2), 277–289 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  10. Chuzhoy, J., Naor, J.: New hardness results for congestion minimization and machine scheduling. In: Proceedings of the 36th Annual ACM Symposium of Theory of Computing, pp. 28–34, Chicago, IL (2004)

  11. Dinitz Y., Garg N., Goemans M.X.: On the single-source unsplittable flow problem. Combinatorica 19, 17–41 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fratta, L., Gerla, M., Kleinrock, L.: The flow deviation method: an approach to store-and-forward computer-communication network design. Networks 3 (1973)

  13. Goldfarb D., Grigoriadis M.: A computational comparison of the Dinic and network simplex methods for maximum flow. Ann. Oper. Res. 13, 83–123 (1988)

    Article  MathSciNet  Google Scholar 

  14. Guruswami, V., Khanna, S., Rajaraman, R., Sheperd, B., Yannakakis, M.: Near optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 19–28 (1999)

  15. Hu J., Sapatnekar S.S.: A survey on multi-net global routing for integrated circuits. Integration VLSI J. 31, 1–49 (2001)

    Article  MATH  Google Scholar 

  16. Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT (1996)

  17. Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 68–77 (1996)

  18. Kleinberg, J., Tardos, E.: Disjoint paths in densely embedded graphs. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 52–61 (1995)

  19. Koch, R., Skutella, M., Spenke, I.: Approximation and complexity of k-splittable flows. Technical Report (2005)

  20. Kolliopoulos, S.G.: Improved approximation algorithms for unsplittable flow problems. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 426–435 (1997)

  21. Kolliopoulos S.G.: Minimum-cost single-source 2-splittable flow. Inf. Process. Lett. 9(1), 15–18 (2005)

    Article  MathSciNet  Google Scholar 

  22. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 184–193 (2002)

  23. Martens M., Skutella M.: Flows on few paths: algorithms and lower bounds. Networks 48(2), 68–76 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  24. Müller, D.: Optimizing Yield in Global Routing. ICCAD (2006)

  25. Raghavan P., Thompson C.: Randomized rounding: a technique for provable good algorithms and algorithmic proofs. Combinatorica 7(4), 365–374 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  26. Raghavan P., Thompson C.: Multiterminal global routing: a deterministic approximation scheme. Algorithmica 6, 73–82 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  27. Shahrokhi F., Matula D.W.: The maximum concurrent flow problem. J ACM 37, 318–334 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  28. Skutella M.: Approximating the single source unsplittable min-cost flow problem. Math. Programm. 91, 493–514 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  29. Vygen, J.: Near-optimum global routing with coupling, delay bounds, and power consumption. In: Proceedings of the 10th International IPCO Conference, pp. 308–324. Springer, New York (2004)

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Impresa, Università di Roma “Tor Vergata”, Via del Politecnico 1, 00133, Rome, Italy

    Massimiliano Caramia

  2. Dipartimento di Ingegneria Economico-Gestionale, Università di Napoli “Federico II”, Piazzale Tecchio 80, 80125, Naples, Italy

    Antonino Sgalambro

Authors
  1. Massimiliano Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonino Sgalambro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Massimiliano Caramia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caramia, M., Sgalambro, A. A fast heuristic algorithm for the maximum concurrent k-splittable flow problem. Optim Lett 4, 37–55 (2010). https://doi.org/10.1007/s11590-009-0147-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-009-0147-4

Keywords

Search

Navigation