Abstract
The Multi-Commodity \(k\)-splittable Maximum Flow Problem consists of maximizing the amount of flow routed through a network such that each commodity uses at most \(k\) paths and such that edge capacities are satisfied. The problem is \(\mathcal NP \)-hard and has application in a.o. telecommunications. In this paper, a local search heuristic for solving the problem is proposed. The heuristic is an iterative shortest path procedure on a reduced graph combined with a local search procedure to modify certain path flows and prioritize the different commodities. The heuristic is tested on benchmark instances from the literature and solves 83 % of the instances to optimality. For the remaining instances, the heuristic finds good solution values which on average are 1.04 % from the optimal. The heuristic solves all instances in less than a second. Compared to other heuristics, the proposed heuristic again shows superior performance with respect to solution quality.
Similar content being viewed by others
References
Alvelos, F.: Branch-and-Price and Multicommodity Flows. PhD thesis, Universidade do Minho, Braga (2005)
Baier, G., Kohler, E., Skutella, M.: On the $k$-splittable flow problem. Algorithmica 42, 231–248 (2005)
Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318–326 (2000)
Caramia, M., Sgalambro, A.: An exact approach for the maximum concurrent k-splittable flow problem. Optim. Lett. 2, 251–265 (2008)
Caramia, M., Sgalambro, A.: A fast heuristic algorithm for the maximum concurrent k-splittable flow problem. Optim. Lett. 4, 37–55 (2010)
Evans, J.W., Filsfils, C.: Deploying IP and MPLS QoS for Multiservice Networks: Theory and Practice. Morgan Kaufmann (2007)
Gamst, M., Jensen, P.N., Pisinger, D., Plum, C.E.M.: Two- and three-index formulations of the minimum cost multicommodity $k$-splittable flow problem. Eur. J. Oper. Res. 202(1), 82–89 (2010)
Gamst, M., Petersen, B.: Comparing branch-and-price algorithms for the multicommodity k-splittable maximum flow problem. Eur. J. Oper. Res. 217, 278–286 (2012)
Koch, R., Skutella, M., Spenke, I.: Maximum \(k\)-splittable s, t-flows. Theory Comput. Syst. 43(1), 1432–4350 (2008)
Kolliopoulos, S.G.: Minimum-cost single-source 2-splittable flow. Infor. Proces. Lett. 94(1), 15–18 (2005)
Larsson, T., Yuan, D.: An augmented Lagrangian algorithm for large scale multicommodity outing. Comput. Optim. Appl. 27(2), 187–215 (2004)
Martens, M., Skutella, M.: Flows on few paths: algorithms and lower bounds. Networks 48(2), 68–76 (2006)
Salazar, F., Skutella, M.: Single-source k-splittable min-cost flows. Oper. Res. Lett. 37, 71–74 (2009)
Truffot, J., Duhamel, C.: A branch and price algorithm for the $k$-splittable maximum flow problem. Discret. Optim. 5(3), 629–646 (2008)
Truffot, J., Duhamel, C., Mahey, P.: Using branch-and-price to solve multicommodity $k$-splittable flow problems.In: Proceedings of International Network Optimization Conference (INOC), In INOC Conference, Lisbonne (2005)
Waissi, G., Setubal, J.: Generator tg (2011) http://www.informatik.uni-trier.de/naeher/Professur/research/generators/maxflow/tg/index.html
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gamst, M. A local search heuristic for the Multi-Commodity \(k\)-splittable Maximum Flow Problem. Optim Lett 8, 919–937 (2014). https://doi.org/10.1007/s11590-013-0622-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-013-0622-9