Annals of Operations Research

, Volume 78, Issue 0, pp 31–50 | Cite as

Solution approaches to hub location problems

  • Sue Abdinnour-Helm
  • M.A. Venkataramanan


The hub location problem involves a network of origins and destinations over which transport takes place. Any distribution system falls into this type of category. In this paper, we present a new quadratic integer formulation for the Uncapacitated Hub Location Problem (UHP), which is based on the idea of multi-commodity flows in networks. This new formulation lends itself well for using a branch-and-bound procedure to find optimal solutions. The branch-and-bound procedure is not implemented in a traditional fashion, where bounds are obtained by linearizing the objective function and relaxing the integrality constraints. Instead, a more sophisticated approach is used where bounds are obtained by employing the underlying network structure of the problem. In addition, an artificial intelligence-based technique (Genetic Search) is designed to find solutions quickly and efficiently. The two solution approaches assume that the number of hubs is a variable, each spoke is assigned to a single hub, and all hubs are interconnected. The model and the algorithm can be applied even when all the hubs are not directly linked.


Objective Function Network Structure Distribution System Location Problem Solution Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S.F. Abdinnour, Solution approaches to hub location problems, Ph.D. Dissertation, Department of Decision and Information Systems, Indiana University, 1994.Google Scholar
  2. [2]
    T. Aykin, On a quadratic integer program for the location of interacting hub facilities, European Journal of Operational Research 46(1990)409 - 411.Google Scholar
  3. [3]
    T. Aykin, Networking policies for hub-and-spoke systems with applications to the air transportation system, GSM Working Paper No. 94-02, 1994.Google Scholar
  4. [4]
    T. Aykin and G.F. Brown, Interacting new facilities and location - allocation problems, Transportation Science 26(1992)212 - 222.Google Scholar
  5. [5]
    J.F. Campbell, Hub location problems and the p-hub median problem, Working Paper 91-06-19, Center for Business and Industrial Studies, University of Missouri - St. Louis, St. Louis, MO, 1991.Google Scholar
  6. [6]
    J.F. Campbell, Integer programming formulations of discrete hub location problems, European Journal of Operational Research 72(1994)387 - 405.Google Scholar
  7. [7]
    J.F. Campbell, A survey of network hub location, Studies in Locational Analysis 6(1994)31- 49.Google Scholar
  8. [8]
    L. Cooper, Heuristic methods for location - allocation problems, SIAM Review 6(1964)37 - 53.Google Scholar
  9. [9]
    M.S. Daskin and N.D. Panayotopoulos, A Lagrangian relaxation approach to assigning aircraft to routes in hub and spoke networks, Transportation Science 23(1989)91 - 99.Google Scholar
  10. [10]
    L. Davis, Genetic Algorithms and Simulated AnnealingMorgan Kaufmann, Los Altos, CA, 1987.Google Scholar
  11. [11]
    L. Davis, Handbook of Genetic AlgorithmsVan Nostrand Reinhold, New York, 1991.Google Scholar
  12. [12]
    K.A. DeJong, An analysis of a class of genetic adaptive systems, Doctoral Dissertation, University of Michigan, 1975.Google Scholar
  13. [13]
    G. Dobson and P.J. Lederer, Airline scheduling and routing in a hub-and-spoke system, Transportation Science 27(1993)281 - 297.Google Scholar
  14. [14]
    A.M. Geoffrion and R.E. Marsten, Integer programming algorithms: A framework and state-of-the-art survey, Management Science 18(1972)465 - 491.Google Scholar
  15. [15]
    D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine LearningAddison-Wesley, Reading, MA, 1989.Google Scholar
  16. [16]
    P.G. Grove and M.E. O'Kelly, Hub networks and simulated schedule delay, Papers of the Regional Science Association 59(1986)103-119.Google Scholar
  17. [17]
    J.H. Holland, Adaptation in Natural and Artificial SystemsUniversity of Michigan Press, Ann Arbor, MI, 1975.Google Scholar
  18. [18]
    A. Kanafani and A.A. Ghobrial, Airline hubbing - some implications for airport economics, Transportation Research 19A(1985)15 - 27.Google Scholar
  19. [19]
    J.G. Klincewicz, Heuristics for the p-hub location problem, European Journal of Operational Research 53(1991)25 - 37.Google Scholar
  20. [20]
    J.G. Klincewicz, Avoiding local optima in the p-hub location problem using tabu search and GRASP, Annals of Operations Research 40(1992)283- 302.Google Scholar
  21. [21]
    Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution ProgramsSpringer, Berlin/ Heidelberg, 1992.Google Scholar
  22. [22]
    M.E. O'Kelly, The location of interacting hub facilities, Transportation Science 20(1986)92 - 106.Google Scholar
  23. [23]
    M.E. O'Kelly, Activity levels at hub facilities in interacting networks, Geographical Analysis 18 (1986)343 - 356.Google Scholar
  24. [24]
    M.E. O'Kelly, A quadratic integer program for the location of interacting hub facilities, European Journal of Operational Research 32(1987)393 - 404.Google Scholar
  25. [25]
    M.E. O'Kelly, Hub facility location with fixed costs, The Journal of the Regional Science Association International 71(1992)293 - 306.Google Scholar
  26. [26]
    M.E. O'Kelly and Y. Lao, Mode choice in a hub-and-spoke network: A zero - one linear programming approach, Geographical Analysis 23(1991)283 - 297.Google Scholar
  27. [27]
    L.M. Ostresh, Jr., An efficient algorithm for solving the two center location - allocation problem, Journal of Regional Science 15(1975)209 - 216.Google Scholar
  28. [28]
    L.T. Phillips, Air carrier activity at major hub airports and changing interline practices in the United States airline industry, Transportation Research 21A(1987)215 - 221.Google Scholar
  29. [29]
    J.D. Schaeffer, R.A. Caruana, L.J. Eschelman and R. Das, A study of control parameters affecting online performance of genetic algorithms for function optimization, Proceedings of the 3rd International Conference on Genetic Algorithms Morgan Kaufmann, Los Altos, CA, 1989, pp. 51 - 60.Google Scholar
  30. [30]
    D. Skorin-Kapov and J. Skorin-Kapov, On tabu search for the location of interacting hub facilities, European Journal of Operations Research, 1991, to appear.Google Scholar
  31. [31]
    D. Skorin-Kapov, J. Skorin-Kapov and M. O'Kelly, Tight linear programming relaxations of uncapacitated p-hub median problems, Proceedings of the National Decision Science Conference. Boston, 1994.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Sue Abdinnour-Helm
  • M.A. Venkataramanan

There are no affiliations available

Personalised recommendations