Skip to main content
SpringerLink
Log in

A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9849))

Included in the following conference series:

  • 1181 Accesses

Abstract

In this paper we consider an extended version of the classical capacitated single allocation hub location problem in which the size of the hubs must be chosen from a finite and discrete set of allowable capacities. We develop a Lagrangian relaxation approach that exploits the problem structure and decomposes the problem into a set of smaller subproblems that can be solved efficiently. Upper bounds are derived by Lagrangian heuristics followed by a local search method. Moreover, we propose some reduction tests that allow us to decrease the size of the problem. Our computational experiments on some challenging benchmark instances from literature show the advantage of the decomposition approach over commercial solvers.

The first author has been supported by the German Research Foundation (DFG) under grant BU 2313/2.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Notes

  1. 1.

    http://people.brunel.ac.uk/~mastjjb/jeb/orlib/phubinfo.html.

References

  1. Alumur, S.A., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1–21 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387–405 (1994)

    Article  MATH  Google Scholar 

  3. Campbell, J.F., O’Kelly, M.E.: Twenty-five years of hub location research. Transp. Sci. 46(2), 153–169 (2012)

    Article  Google Scholar 

  4. Contreras, I., Díaz, J.A., Fernández, E.: Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS J. Comput. 23(1), 41–55 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Correia, I., Nickel, S., Saldanha-da Gama, F.: Single-assignment hub location problems with multiple capacity levels. Transp. Res. Part B Method. 44(8), 1047–1066 (2010)

    Article  Google Scholar 

  6. Ernst, A.T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3), 139–154 (1996)

    Article  MATH  Google Scholar 

  7. Ernst, A.T., Krishnamoorthy, M.: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem. Eur. J. Oper. Res. 104(1), 100–112 (1998)

    Article  MATH  Google Scholar 

  8. Ernst, A.T., Krishnamoorthy, M.: Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86, 141–159 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. da Graça Costa, M., Captivo, M.E., Clímaco, J.: Capacitated single allocation hub location problem-a bi-criteria approach. Comput. Oper. Res. 35(11), 3671–3695 (2008)

    Article  MATH  Google Scholar 

  10. Jaillet, P., Song, G., Yu, G.: Airline network design and hub location problems. Location Sci. 4(3), 195–212 (1996)

    Article  MATH  Google Scholar 

  11. Klincewicz, J.G.: Hub location in backbone/tributary network design: a review. Location Sci. 6(1), 307–335 (1998)

    Article  Google Scholar 

  12. Labbé, M., Yaman, H., Gourdin, E.: A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102(2), 371–405 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Meier, J.F., Clausen, U., Rostami, B., Buchheim, C.: A compact linearisation of Euclidean single allocation hub location problems. Electronic Notes in Discrete Mathematics Accepted for Publication (2015)

    Google Scholar 

  14. Nickel, S., Schöbel, A., Sonneborn, T.: Hub location problems in urban traffic networks. In: Pursula, M., Niittymäki, J. (eds.) Mathematical Methods on Optimization in Transportation Systems, pp. 95–107. Springer, New York (2001)

    Chapter  Google Scholar 

  15. O’Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3), 393–404 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  16. Rostami, B., Buchheim, C., Meier, J.F., Clausen, U.: Lower bounding procedures for the single allocation hub location problem. Electronic Notes in Discrete Mathematics Accepted for Publication (2015)

    Google Scholar 

  17. Rostami, B., Meier, J.F., Buchheim, C., Clausen, U.: The uncapacitated single allocation \(p\)-hub median problem with stepwise cost function. Technical report, Optimization Online (2015). http://www.optimization-online.org/DB_HTML/2015/07/5044.html

  18. Skorin-Kapov, D., Skorin-Kapov, J., O’Kelly, M.: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems. Eur. J. Oper. Res. 94(3), 582–593 (1996)

    Article  MATH  Google Scholar 

  19. Yaman, H., Carello, G.: Solving the hub location problem with modular link capacities. Comput. Oper. Res. 32(12), 3227–3245 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik, TU Dortmund, Dortmund, Germany

    Borzou Rostami, Christopher Strothmann & Christoph Buchheim

Authors
  1. Borzou Rostami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christopher Strothmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christoph Buchheim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Borzou Rostami .

Editor information

Editors and Affiliations

  1. University of Salerno , Fisciano, Italy

    Raffaele Cerulli

  2. Kyoto University , Kyoto, Japan

    Satoru Fujishige

  3. LAMSADE, Université Paris-Dauphine , Paris , France

    A. Ridha Mahjoub

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Rostami, B., Strothmann, C., Buchheim, C. (2016). A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels. In: Cerulli, R., Fujishige, S., Mahjoub, A. (eds) Combinatorial Optimization. ISCO 2016. Lecture Notes in Computer Science(), vol 9849. Springer, Cham. https://doi.org/10.1007/978-3-319-45587-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45587-7_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45586-0

  • Online ISBN: 978-3-319-45587-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation