Skip to main content
SpringerLink
Log in

An Iterated Local Search Heuristic for a Capacitated Hub Location Problem

  • Conference paper
Hybrid Metaheuristics (HM 2006)

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

Included in the following conference series:

Abstract

This paper addresses a capacitated hub problem consisting of choosing the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complete. For solving this problem we propose a heuristic approach that makes use of a linear programming relaxation in an Iterated Local Search scheme. The heuristic turns out to be very effective and the results of the computational experiments show that near-optimal solutions can be derived rapidly for instances of large size.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aykin, T.: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problems. European Journal of Operational Research 79, 501–523 (1994)

    Article  MATH  Google Scholar 

  2. Barahona, F.: Network design using cut inequalities. SIAM Journal on Optimization 6, 823–837 (1996)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Carello, G., Della Croce, F., Ghirardi, M., Tadei, R.: Solving the hub location problem in telecommunication network design: a local search approach. Networks 44, 94–105 (2004)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Ernst, E., Krishnamoorthy, M.: Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research 86, 141–159 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hamacher, H.W., Labbé, M., Nickel, S., Sonneborn, T.: Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics 145, 104–116 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Holmberg, K., Yuan, D.: A Langrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research 48, 461–481 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, Kluwer’s International Series in Operations Research & Management Science, Norwell (2002)

    Google Scholar 

  12. Magnanti, T.L., Wong, R.T.: Network design and transportation planning: models and algorithms. Transportation Science 18, 1–55 (1984)

    Article  Google Scholar 

  13. Mayer, G., Wagner, B.: HubLocator: an exact solution method for the multiple allocation hub location problem. Computer & Operations Research 29, 715–739 (2002)

    Article  MATH  Google Scholar 

  14. O’Kelly, M., Bryan, D., Skorin-Kapov, D., Skorin-Kapov, J.: Hub network design with single and multiple allocation: A computational study. Location Science 4, 125–138 (1996)

    Article  MATH  Google Scholar 

  15. Rodríguez-Martín, I., Salazar-González, J.J.: Decomposition approaches for a Capacitated Hub Problem. In: Lemaître, C., Reyes, C.A., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 154–164. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Skorin-Kapov, D., Skorin-Kapov, J., O’Kelly, M.: Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research 94, 582–593 (1996)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIOC, Universidad de La Laguna, 38271, La Laguna, Tenerife, Spain

    Inmaculada Rodríguez-Martín & Juan-José Salazar-González

Authors
  1. Inmaculada Rodríguez-Martín
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan-José Salazar-González
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Statistics and Computer Science, La Laguna University Spain,  

    Francisco Almeida

  2. Universitat Politècnica de Catalunya, Omega Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa Aguilera

  3. ALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain

    Christian Blum

  4. DEIOC, Universidad de La Laguna, Escuela Técnica Superior en Ingeniería Informática, Avda. Astrofísico Francisco Sánchez, s/n, 38271, La Laguna, Tenerife, Spain

    José Marcos Moreno Vega

  5. Escuela Técnica Superior en Ingeniería Informática, Universidad de La Laguna, Avda. Astrofísico Francisco Sánchez, s/n, 38271, La Laguna, Tenerife, Spain

    Melquíades Pérez Pérez

  6. DEIS, Campus of Cesena Alma Mater Studiorum, Università di Bologna, Cesena, Italy

    Andrea Roli

  7. Université Libre de Bruxelles, IRIDIA CP 194/6, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodríguez-Martín, I., Salazar-González, JJ. (2006). An Iterated Local Search Heuristic for a Capacitated Hub Location Problem. In: Almeida, F., et al. Hybrid Metaheuristics. HM 2006. Lecture Notes in Computer Science, vol 4030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890584_6

Download citation

  • DOI: https://doi.org/10.1007/11890584_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46384-9

  • Online ISBN: 978-3-540-46385-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation