Bounds and Heuristics for the Shortest Capacitated Paths Problem

Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying capacity constraints on the arcs of G.We formulate the SCPP as a 0-1 linear program and study two Lagrangian relaxations for getting lower bounds on the optimal value. We then propose two heuristic methods. The first one is based on a greedy approach, while the second one is an adaptation of the tabu search meta-heuristic.

[1]  John W. Mamer,et al.  Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm , 1997, INFORMS J. Comput..

[2]  Jeff L. Kennington,et al.  A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..

[3]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[4]  Sungsoo Park,et al.  An Integer Programming Approach to the Bandwidth Packing Problem , 1996 .

[5]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[6]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..

[7]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[8]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[9]  Jens Vygen,et al.  NP-completeness of Some Edge-disjoint Paths Problems , 1995, Discret. Appl. Math..

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

[11]  MATTHIAS MIDDENDORF,et al.  On the complexity of the disjoint paths problem , 1993, Comb..

[12]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[13]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[14]  M. Minoux,et al.  Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux , 1975 .

[15]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[16]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

[17]  Peter Kubat,et al.  Multicommodity Flows in Ring Networks , 1996, INFORMS J. Comput..

[18]  Jennifer Ryan,et al.  Path assignment for call routing: An application of tabu search , 1993, Ann. Oper. Res..