Optimizing access to service based networks

We consider the problem of determining the optimal access topology to service based networks. The problem is formulated as a concentrator location problem with a discontinuous piece wise linear objective function that depends on the traffic of the nodes that are homed to the concentrator. Five heuristics are developed to solve the problem and are compared on an extensive set of examples. Based on this comparison a combination heuristic utilizing a Lagrangian relaxation and swap drop add approach was found to give the best solution in the minimal time.

[1]  Martin J. Fischer,et al.  A methodology for designing large private line transmission networks with multiple facilities , 1993, Telecommun. Syst..

[2]  K. Holmberg,et al.  A Lagrangean heuristic for the facility location problem with staircase costs , 1997 .

[3]  Choong Y. Lee.  An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type , 1991, Comput. Oper. Res..

[4]  K. Holmberg.  Solving the staircase cost facility location problem with decomposition and piecewise linearization , 1994 .

[5]  Gérard Cornuéjols,et al.  Some facets of the simple plant location polytope , 1982, Math. Program..

[6]  Umit Akinc.  Note---Multi-Activity Facility Design and Location Problems , 1985 .

[7]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[8]  G. Cornuéjols,et al.  A comparison of heuristics and relaxations for the capacitated plant location problem , 1991 .

[9]  Choong Y. Lee,et al.  A cross decomposition algorithm for a multiproduct-multitype facility location problem , 1993, Comput. Oper. Res..

[10]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..

[11]  Choong Y. Lee.  An Algorithm for the Design of Multitype Concentrator Networks , 1993 .

[12]  Dong-Wan Tcha,et al.  A cross decomposition procedure for the facility location problem with a choice of facility type , 1986 .

[13]  G. Nemhauser,et al.  On the Uncapacitated Location Problem , 1977 .

[14]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[15]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .