Skip to main content
SpringerLink
Log in

A Heuristic for the Capacitated Single Allocation Hub Location Problem

  • Chapter
Advances in Industrial Engineering and Operations Research

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 5))

The capacitated single allocation hub location problem (CSAHLP) is a decision problem in regard to the number of hubs, hub locations, and the allocation of nonhubs to hubs, considering that each hub has its capacity constraint. The crucial factors for designing an economical hub network are to determine the optimal number of hubs, to properly locate the hubs, and to allocate nonhubs to hubs. In this research an effective heuristic is presented to resolve the CSAHLP. Computational characteristics of the presented heuristic are evaluated through extensively computational experiments using the Australia Post data set. Computational results indicate that the presented heuristic outperforms a simulated annealing method from the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abdinnour-Helm (2001) Using simulated annealing to solve the p-hub median problem. International Journal of Physical Distribution and Logistics Management, 31: 203-220.

    Article  Google Scholar 

  2. T. Aykin (1995) Networking policies for hub-and-spoke systems with application to the air transportation system. Transportation Science, 29: 201-221.

    Article  Google Scholar 

  3. N. Bania, P. Bauer, and T. Zlatoper (1998) U.S. air passenger service: A taxonomy of route networks, hub locations, and competition. Logistics and Transportation Review, 34: 53-74.

    Article  Google Scholar 

  4. T. Don, S. Harit, J.R. English, and G. Whicker (1995) Hub and spoke networks in truckload trucking: Configuration, testing, and operational concerns. Logistics and Transportation, 31: 209-237.

    Google Scholar 

  5. J.G. Klincewicz (1998) Hub location in backbone tributary network design: A review. Location Science, 6: 307-335.

    Article  Google Scholar 

  6. M.J. Kuby and R.G. Gray (1993) Hub network design problem with stopovers and feeders: Case of Federal Express. Transportation Research, 27: 1-12.

    Article  Google Scholar 

  7. K. Lumsden, F. Dallari, and R. Ruggeri (1999) Improving the efficiency of the hub and spoke system for the SKF European distribution network. International Journal of Physical Distribution and Logistics Management, 29: 50-64.

    Article  Google Scholar 

  8. J. Campbell, A. Ernst, and M. Krishnamoorthy (2002) Hub location problems. In Z Drezner and H Hammacher (eds.) Facility location: applications and theory. Springer, Berlin.

    Google Scholar 

  9. J.F. Campbell (1994) Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72: 387-405.

    Article  Google Scholar 

  10. A. Ernst and M. Krishnamoorthy (1999) Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86: 141-159.

    Article  MathSciNet  Google Scholar 

  11. J.-F. Chen (2007) A hybrid heuristic for the uncapacitated single allocation hub location problem. Omega-International Journal of Management Science, 35: 211-220.

    Article  Google Scholar 

  12. A. Ernst and M. Krishnamoorthy (1998) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research, 104: 100-112.

    Article  Google Scholar 

  13. M.E. O’Kelly (1987) A quadratic integer problem for the location of interacting hub facilities. European Journal of Operational Research, 32: 393-404.

    Article  MathSciNet  Google Scholar 

  14. J.G. Klincewicz (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Annals of Operations Research, 40: 283-302.

    Article  MathSciNet  Google Scholar 

  15. J.F. Campbell (1996) Hub location and the p-hub median problem. Operations Research, 44:923-935.

    Article  MathSciNet  Google Scholar 

  16. J.G. Klincewicz (1996) A dual algorithm for the uncapacitated hub location problem. Location Science, 4: 173-184.

    Article  Google Scholar 

  17. G. Mayer and B. Wagner (2002) HubLocator: An exact solution method for the multiple allocation hub location problem. Computers and Operations Research, 29: 715-739.

    Article  Google Scholar 

  18. N. Boland, M. Krishnamoorthy, A. Ernst, and J. Ebery (2004) Preprocessing and cutting for multiple allocation hub location problems. European Journal of Operational Research, 155: 638-653.

    Article  MathSciNet  Google Scholar 

  19. M.E. O’Kelly (1992) Hub facility with fixed costs. The Journal of RSAI, 71: 293-306.

    Google Scholar 

  20. S. Abdinnour-Helm and M.A. Venkataramanan (1998) Solution approaches to hub location problems. Annals of Operational Research, 78: 31-50.

    Article  Google Scholar 

  21. S. Abdinnour-Helm (1998) A hybrid heuristic for the uncapacitated hub location problem. European Journal of Operational Research, 106: 489-499.

    Article  Google Scholar 

  22. H. Topcuoglu, F. Corut, M. Ermis, and G. Yilmaz (2005) Solving the uncapacitated hub loca-tion using genetic algorithms. Computers and Operations Research, 32: 967-984.

    Article  Google Scholar 

  23. J. Ebery, M. Krishnamoorthy, A. Ernst, and N. Boland (2000) The capacitated multiple allo-cation hub location problem: Formulations and algorithms. European Journal of Operational Research, 120: 614-631.

    Article  Google Scholar 

  24. M.E. O’Kelly and H. Miller (1994) The hub network design problem: A review and synthesis. Journal of Transport Geography, 2: 31-40.

    Article  Google Scholar 

  25. D.L. Bryan (1998) Extensions to the hub location problems: formulations and numerical ex-amples. Geographical Analysis, 30: 315-330.

    Google Scholar 

  26. D.L. Bryan and M.E. O’Kelly (1999) Hub-and-spoke networks in air transportation: An ana-lytical review. Journal of Regional Science, 39: 275-295.

    Article  Google Scholar 

  27. N. Metropolis, A.N. Rosenbluth, M.N. Rosenbluth, and A.H. Teller (1953) Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21: 1087-1092.

    Article  Google Scholar 

  28. A. Ernst and M. Krishnamoorthy (1996) Efficient algorithms for the uncapacitated single al-location p-hub median problem. Location Science, 4: 139-154.

    Article  Google Scholar 

  29. S. White (1984) Concepts of scale in simulated annealing. Proceeding of the IEEE Interna-tional Conference on Computer Design. Port Chester, NY, pp. 646-651.

    Google Scholar 

  30. I. Osman (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operational Research, 41: 421-451.

    Article  Google Scholar 

  31. Y. Lee, B. Lim, and J. Park (1996) A hub location problem in designing digital data service networks: Lagrangian relaxation approach. Location Science, 4: 185-194.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Systems Management, Feng Chia University, 40724, Taiwan, China

    Jeng-Fung Chen

Authors
  1. Jeng-Fung Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong, China

    Alan H. S. Chan

  2. IAENG Secretariat, 37-39 Hung To Road, Hong Kong, China

    Sio-Iong Ao

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Chen, JF. (2008). A Heuristic for the Capacitated Single Allocation Hub Location Problem. In: Chan, A.H.S., Ao, SI. (eds) Advances in Industrial Engineering and Operations Research. Lecture Notes in Electrical Engineering, vol 5. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74905-1_14

Download citation

Publish with us

Policies and ethics

Search

Navigation