On solving multi-commodity flow problems: An experimental evaluation

Abstract Multi-commodity flow problems (MCFs) can be found in many areas, such as transportation, communication, and logistics. Therefore, such problems have been studied by a multitude of researchers, and a variety of methods have been proposed for solving it. However, most researchers only discuss the properties of different models and algorithms without taking into account the impacts of actual implementation. In fact, the true performance of a method may differ greatly across various implementations. In this paper, several popular optimization solvers for implementations of column generation and Lagrangian relaxation are discussed. In order to test scalability and optimality, three groups of networks with different structures are used as case studies. Results show that column generation outperforms Lagrangian relaxation in most instances, but the latter is better suited to networks with a large number of commodities.

[1]  Matthias Ehrgott,et al.  A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem , 2015, Eur. J. Oper. Res..

[2]  Jacek Gondzio,et al.  New developments in the primal-dual column generation technique , 2013, Eur. J. Oper. Res..

[3]  Walid Ben-Ameur,et al.  Efficient algorithms for the maximum concurrent flow problem , 2015, Networks.

[4]  Bernard Gendron,et al.  Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design , 2014, EURO J. Comput. Optim..

[5]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[6]  Yifei Zhao,et al.  Cooperative coalition for formation flight scheduling based on incomplete information , 2015 .

[7]  Jordi Castro,et al.  Improving an interior-point algorithm for multicommodity flows by quadratic regularizations , 2012, Networks.

[8]  Lance Sherry,et al.  Comparison of alternative route selection strategies based on simulation optimization , 2016 .

[9]  Pablo Cortés,et al.  Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs , 2013 .

[10]  Xiaoqian Sun,et al.  Efficient Compression of 4D-Trajectory Data in Air Traffic Management , 2015, IEEE Transactions on Intelligent Transportation Systems.

[11]  Cynthia Barnhart,et al.  Multicommodity Flow Problems , 2009, Encyclopedia of Optimization.

[12]  Marco Laumanns,et al.  A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling , 2011, Transp. Sci..

[13]  Xiaoqian Sun,et al.  Temporal evolution analysis of the European air transportation system: air navigation route network and airport network , 2015 .

[14]  Cynthia Barnhart,et al.  A column generation and partitioning approach for multi-commodity flow problems , 1994, Telecommun. Syst..

[15]  Eiji Oki,et al.  GLPK (GNU Linear Programming Kit) , 2012 .

[16]  Eric Jones,et al.  SciPy: Open Source Scientific Tools for Python , 2001 .

[17]  Jacek Gondzio,et al.  A new warmstarting strategy for the primal-dual column generation method , 2015, Math. Program..

[18]  Daniel Kuhn,et al.  Distributionally robust multi-item newsvendor problems with multimodal demand distributions , 2014, Mathematical Programming.

[19]  Pascal Fua,et al.  Multi-Commodity Network Flow for Tracking Multiple People , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Stephen P. Boyd,et al.  CVXPY: A Python-Embedded Modeling Language for Convex Optimization , 2016, J. Mach. Learn. Res..

[21]  Walid Ben-Ameur,et al.  A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow , 2013, Electron. Notes Discret. Math..

[22]  Lisa Fleischer,et al.  Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[24]  Jacek Gondzio,et al.  Large-scale optimization with the primal-dual column generation method , 2013, Math. Program. Comput..

[25]  Reinaldo Morabito,et al.  Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks , 2014, Eur. J. Oper. Res..

[26]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[27]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[28]  Tibor Cinkler,et al.  A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[29]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[30]  Jean-Philippe Vial,et al.  Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM , 2006, Oper. Res..

[31]  George Karakostas.  Faster approximation schemes for fractional multicommodity flow problems , 2002, SODA '02.