The three-hub center allocation problem

In a hub network, the p-hub center single allocation problem is to allocate each non-hub node to one and only one hub from a given set of p hubs such that the maximum travel time (or distance) between any origin-destination pair is minimized. The problem is NP-Complete in general. We address the three-hub center single allocation problem in this paper and provide a polynomial algorithm to solve the p-hub center single allocation problem when p = 3.

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

[2]  James F. Campbell.  Hub Location and the p-Hub Median Problem , 1996, Oper. Res..

[3]  Gerhard J. Woeginger,et al.  Uncapacitated single and multiple allocation p-hub center problems , 2009, Comput. Oper. Res..

[4]  Timothy J. Lowe,et al.  The p-hub center allocation problem , 2007, Eur. J. Oper. Res..

[5]  Ananth V. Iyer,et al.  Accumulation Point Location on Tree Networks for Guaranteed Time Distribution , 1990 .

[6]  T. Aykin.  On “a quadratic integer program for the location of interacting hub facilities” , 1990 .

[7]  H. Miller,et al.  Solution strategies for the single facility minimax hub location problem , 1991 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Jadranka Skorin-Kapov,et al.  HUB NETWORK DESIGN WITH SINGLE AND MULTIPLE ALLOCATION: A COMPUTATIONAL STUDY , 1996 .

[10]  Bahar Yetis Kara,et al.  On the single-assignment p-hub center problem , 2000, Eur. J. Oper. Res..

[11]  F. S. Pamuk,et al.  A solution to the hub center problem via a single-relocation algorithm with tabu search , 2001 .

[12]  J. G. Klincewicz,et al.  Heuristics for the p-hub location problem , 1991 .

[13]  Morton E. O'Kelly,et al.  The Location of Interacting Hub Facilities , 1986, Transp. Sci..

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