An exact approach for the multicommodity network optimization problem with a step cost function

We investigate the Multicommodity Network Optimization Problem with a Step Cost Function (MNOP-SCF) where the available facilities to be installed on the edges have discrete step-increasing cost and capacity functions. This strategic long-term planning problem requires installing at most one facility capacity on each edge so that all the demands are routed and the total installation cost is minimized. We describe a path-based formulation that we solve exactly using an enhanced constraint generation based procedure combined with columns and new cuts generation algorithms. The main contribution of this work is the development of a new exact separation model that identifies the most violated bipartition inequalities coupled with a knapsack-based problem that derives additional cuts. To assess the performance of the proposed approach, we conducted computational experiments on a large set of randomly generated instances. The results show that it delivers optimal solutions for large instances with up to 100 nodes, 600 edges, and 4950 commodities while in the literature, the best developed approaches are limited to instances with 50 nodes, 100 edges, and 1225 commodities.

[1]  Jean-Yves Potvin,et al.  Diversification strategies in local search for a nonbifurcated network loading problem , 2002, Eur. J. Oper. Res..

[2]  Mehdi Mrad,et al.  Optimal solution of the discrete cost multicommodity network design problem , 2008, Appl. Math. Comput..

[3]  Alysson M. Costa.  A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

[4]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

[5]  K. Onaga,et al.  On feasibility conditions of multicommodity flows in networks , 1971 .

[6]  Juan José Salazar González,et al.  Exact approaches to the single‐source network loading problem , 2012, Networks.

[7]  Thomas L. Magnanti,et al.  A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems , 2003, Manag. Sci..

[8]  Sara Mattia,et al.  Separating tight metric inequalities by bilevel programming , 2012, Oper. Res. Lett..

[9]  Celso C. Ribeiro,et al.  Adaptive memory in multistart heuristics for multicommodity network design , 2011, J. Heuristics.

[10]  Yogesh K. Agarwal,et al.  Design of Capacitated Multicommodity Networks with Multiple Facilities , 2002, Oper. Res..

[11]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[12]  Arie M. C. A. Koster,et al.  On cut‐based inequalities for capacitated network design polyhedra , 2011, Networks.

[13]  Michel Minoux,et al.  Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..

[14]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

[15]  Jean-Yves Potvin,et al.  A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements , 2003, Ann. Oper. Res..

[16]  Michel Minoux,et al.  Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods , 2001, Ann. Oper. Res..

[17]  Kyungsik Lee,et al.  Benders decomposition approach for the robust network design problem with flow bifurcations , 2013, Networks.

[18]  Antonio Sassano,et al.  Metric Inequalities and the Network Loading Problem , 2004, IPCO.

[19]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[20]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[21]  Michel Minoux,et al.  A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem , 2003, J. Heuristics.

[22]  Mervat Chouman,et al.  Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design , 2017, Transp. Sci..

[23]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[24]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..