Skip to main content
SpringerLink
Log in

A Simple Dual-RAMP Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem

  • Conference paper
  • First Online:
Hybrid Intelligent Systems (HIS 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 923))

Included in the following conference series:

Abstract

This paper presents a Dual-RAMP algorithm for the solution of the multiple allocation hub location problem (UMAHLP). This approach combines information of a lagrangean relaxation procedure with subgradient optimization on the dual side with primal-feasible solutions on primal side, that are obtained by a simple improvement method. The overall performance of the proposed algorithm was tested on standard Australian Post (AP) and Civil Aeronautics Boarding (CAB) instances, comprising 192 test instances. The effectiveness of our approach has been proven by comparing our results with other state-of-the-art algorithms.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  MathSciNet  Google Scholar 

  2. Beasley, J.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 65, 1069–1072 (1990)

    Article  Google Scholar 

  3. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238–252 (1962)

    Article  MathSciNet  Google Scholar 

  4. de Camargo, R.S., et al.: Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. 35(4), 1047–1064 (2008)

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. Cánovas, L., et al.: Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur. J. Oper. Res. 179(3), 990–1007 (2007)

    Article  MathSciNet  Google Scholar 

  7. Contreras, I., et al.: Benders Decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6), 1477–1490 (2011)

    Article  MathSciNet  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  Google Scholar 

  9. Farahani, R.Z., et al.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096–1109 (2013)

    Article  Google Scholar 

  10. Fernandez, E.: Locating Hubs: an overview of models and potential applications. (2013)

    Google Scholar 

  11. Glover, F.: Tabu search—part I. ORSA J. Comput. 1(3), 190–206 (1989)

    Article  Google Scholar 

  12. Glover, F.: Tabu search—part II. ORSA J. Comput. 2(I), 4–32 (1990)

    Article  Google Scholar 

  13. Gamboa, D.: Adaptive memory algorithms for the solution of large scale combinatorial optimization problems. Ph.D. thesis. Instituto Superior Técnico, Universidade Técnica de Lisboa (2008). (In Portuguese)

    Google Scholar 

  14. Kratica, J., et al.: Genetic algorithm for solving uncapacitated multiple allocation hub location problem. Comput. Informatics. 24(4), 415–426 (2005)

    MATH  Google Scholar 

  15. Mayer, G., Wagner, B.: HubLocator: an exact solution method for the multiple allocation hub location problem. Comput. Oper. Res. 29(6), 715–739 (2002)

    Article  Google Scholar 

  16. Mokhtar, H. et al.: A new Benders decomposition acceleration procedure for large scale multiple allocation hub location problems. In: International Congress on Modelling and Simulation, pp. 340–346 (2017)

    Google Scholar 

  17. 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  Google Scholar 

  18. Matos, T., Gamboa, D.: Dual-RAMP for the capacitated single allocation hub location problem. In: Gervasi, O., et al. (eds.) Proceedings of the 17th International Conference on Computational Science and Its Applications -- ICCSA 2017, Part II, Trieste, Italy, 3–6 July 2017, pp. 696–708. Springer (2017)

    Google Scholar 

  19. Rego, C.: RAMP: a new metaheuristic framework for combinatorial optimization. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, pp. 441−460. Kluwer Academic Publishers (2005)

    Google Scholar 

  20. Rego, C., et al.: RAMP for the capacitated minimum spanning tree problem. Ann. Oper. Res. 181(1), 661–681 (2010)

    Article  MathSciNet  Google Scholar 

  21. Riley, R.C.L., Rego, C.: Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling. J. Heuristics (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIICESI – Center for Research and Innovation in Business Sciences and Information Systems, School of Management and Technology, Polytechnic of Porto, Porto, Portugal

    Telmo Matos, Fábio Maia & Dorabela Gamboa

Authors
  1. Telmo Matos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fábio Maia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dorabela Gamboa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Telmo Matos .

Editor information

Editors and Affiliations

  1. School of Engineering, Instituto Superior de Engenharia (ISEP/IPP), Porto, Portugal

    Ana Maria Madureira

  2. Machine Intelligence Research Labs (MIR Labs), Auburn, WA, USA

    Ajith Abraham

  3. Machine Intelligence Research Labs, Auburn, WA, USA

    Niketa Gandhi

  4. Department of Production and Systems, University of Minho, Guimarães, Portugal

    Maria Leonilde Varela

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Matos, T., Maia, F., Gamboa, D. (2020). A Simple Dual-RAMP Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem. In: Madureira, A., Abraham, A., Gandhi, N., Varela, M. (eds) Hybrid Intelligent Systems. HIS 2018. Advances in Intelligent Systems and Computing, vol 923. Springer, Cham. https://doi.org/10.1007/978-3-030-14347-3_32

Download citation

Publish with us

Policies and ethics

Search

Navigation