Solving the hub location problem in a star–star network

We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals and routing the traffic between hubs and the central node. We present two formulations and show that the constraints are facet-defining inequalities in both cases. We test the formulations on a set of instances. Finally, we present a heuristic based on Lagrangian relaxation. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 51(1), 19–33 2008

[1]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[2]  Horst W. Hamacher,et al.  Adapting polyhedral properties from facility to hub location problems , 2004, Discret. Appl. Math..

[3]  Hasan Pirkul,et al.  Locating concentrators in centralized computer networks , 1992, Ann. Oper. Res..

[4]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

[5]  Byung Ha Lim,et al.  A hub location problem in designing digital data service networks: Lagrangian relaxation approach , 1996 .

[6]  Jon Lee,et al.  On the boolean-quadric packinguncapacitated facility-location polytope , 1998, Ann. Oper. Res..

[7]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[8]  Dominique Peeters,et al.  Location on networks , 1992 .

[9]  Andreas T. Ernst,et al.  Hub location problems , 2002 .

[10]  Martine Labbé,et al.  A branch and cut algorithm for hub location problems with single assignment , 2005, Math. Program..

[11]  Andranik Mirzaian,et al.  Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds , 1985, Networks.

[12]  Sungsoo Park,et al.  European Journal of Operational Research a Linear Program for the Two-hub Location Problem , 2022 .

[13]  Jinhyeon Sohn,et al.  The single allocation problem in the interacting three-hub network , 2000, Networks.

[14]  Andreas T. Ernst,et al.  An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems , 1998, INFORMS J. Comput..

[15]  D. Skorin-Kapov,et al.  Tight linear programming relaxations of uncapacitated p-hub median problems , 1996 .

[16]  Michael Jünger,et al.  The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization , 2000, Softw. Pract. Exp..

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

[18]  Egon Balas.  Projection and Lifting in Combinatorial Optimization , 2001, Computational Combinatorial Optimization.

[19]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[20]  Hande Yaman.  Concentrator location in telecommunications networks , 2004 .

[21]  Andreas T. Ernst,et al.  Preprocessing and cutting for multiple allocation hub location problems , 2004, Eur. J. Oper. Res..

[22]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[23]  R. Sridharan.  The capacitated plant location problem , 1995 .

[24]  D. Tcha,et al.  Optimal design of a distributed network with a two-level hierarchical structure , 1992 .

[25]  Zvi Drezner,et al.  Telecommunication and location , 2002 .

[26]  H. D. Ratliff,et al.  Minimum cuts and related problems , 1975, Networks.

[27]  Andreas T. Ernst,et al.  Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .

[28]  Martine Labbé,et al.  Polyhedral Analysis for Concentrator Location Problems , 2006, Comput. Optim. Appl..

[29]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[30]  Antonio Sassano,et al.  On the p-Median polytope , 2001, Math. Program..

[31]  Karen Aardal,et al.  Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..

[32]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

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

[34]  Hasan Pirkul,et al.  An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems , 1998 .

[35]  T. B. Boffey.  Location Problems Arising in Computer Networks , 1989 .

[36]  Egon Balas,et al.  On the Dimension of Projected Polyhedra , 1998, Discret. Appl. Math..

[37]  G. Nemhauser,et al.  Integer Programming , 2020 .

[38]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[39]  Thomas L. Magnanti,et al.  Designing satellite communication networks by zero - one quadratic programming , 1989, Networks.

[40]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[41]  Jamie Ebery,et al.  Solving large single allocation p-hub problems with two or three hubs , 2001, Eur. J. Oper. Res..

[42]  Pierre Chardaire,et al.  Upper and lower bounds for the two‐level simple plant location problem , 1999, Ann. Oper. Res..

[43]  Egon Balas.  Projection with a Minimal System of Inequalities , 1998, Comput. Optim. Appl..

[44]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .