Skip to main content
SpringerLink
Log in

Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

The hub location problem (HLP) is a special type of the facility location problem with numerous applications in the airline industry, postal services, and computer and telecommunications networks. This paper addresses two basic variants of the HLP, namely the uncapacitated single allocation hub location problem (USAHLP) and the uncapacitated single allocation p-hub median problem (USAp HMP). Exact solution procedures based on Benders decomposition algorithm are proposed to tackle large sized instances of these problems. The standard Benders decomposition algorithm is enhanced through implementation of several algorithmic refinements such as using a new cut disaggregation scheme, generating strong optimality cuts, and an efficient algorithm to solve the dual subproblems. Furthermore, a modern implementation of the algorithm is used where a single search tree is established for the problem and Benders cuts are successively added within a branch-and-cut framework. Extensive computational experiments are conducted to examine the efficiency of the proposed algorithms. We have been able to solve all the instances of the problems from all three main data sets of the HLP to optimality in reasonable computational times.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Abdinnour-Helm S (1998) A hybrid heuristic for the uncapacitated hub location problem. Eur J Oper Res 106(2):489–499

    Article  Google Scholar 

  • Abdinnour-Helm S, Venkataramanan M (1998) Solution approaches to hub location problems. Ann Oper Res 78:31–50

    Article  Google Scholar 

  • Abyazi-Sani R, Ghanbari R (2016) An efficient tabu search for solving the uncapacitated single allocation hub location problem. Comput Indus Eng 93:99–109

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Aykin T (1994) Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur J Oper Res 79(3):501–523

    Article  Google Scholar 

  • Benders JF (1962) Partitioning procedures for solving mixedvariables programming problems. Numerisch Mathematik 4(1):238–252

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Campbell JF, O’Kelly ME (2012) Twenty-five years of hub location research. Transp Sci 46(2):153–169

    Article  Google Scholar 

  • Chen JF (2007) A hybrid heuristic for the uncapacitated single allocation hub location problem. Omega 35(2):211–220

    Article  Google Scholar 

  • Contreras I (2015) Hub location problems. In: Laporte G, Nickel S, Saldanha da Gama F (eds) Location Science. Springer International Publishing, pp 311–344

  • Contreras I, Díaz J A, Fernández E (2009) Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectr 31(3):483–505

    Article  Google Scholar 

  • Contreras I, Cordeau JF, Laporte G (2011a) Benders decomposition for large-scale uncapacitated hub location. Oper Res 59(6):1477–1490

    Article  Google Scholar 

  • Contreras I, Cordeau JF, Laporte G (2011b) Stochastic uncapacitated hub location problem. Eur J Oper Res 212(3):518–528

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Contreras I, Cordeau JF, Laporte G (2012) Exact solution of large-scale hub location problems with multiple capacity levels. Transp Sci 46(4):439–459

    Article  Google Scholar 

  • Cunha CB, Silva MR (2007) A genetic algorithm for the problem of configuring a hub-and-spoke network for a ltl trucking company in brazil. Eur J Oper Res 179 (3):747–758

    Article  Google Scholar 

  • de Camargo RS, de Miranda G Jr, Luna HP (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput Oper Res 35(4):1047–1064

  • de Camargo RS, de Miranda G Jr, Ferreira RPM, Luna HP (2009a) Multiple allocation hub-and-spoke network design under hub congestion. Comput Oper Res 36(12):3097–3106

  • de Camargo RS, de Miranda G Jr, Luna HP (2009b) Benders decomposition for hub location problems with economies of scale. Transp Sci 43(1):86–97

  • de Camargo RS, de Miranda G Jr, Ferreira RP (2011) A hybrid outer-approximation/benders decomposition algorithm for the single allocation hub location problem under congestion. Oper Res Lett 39(5):329–337

  • de Camargo RS, de Miranda G Jr, Løkketangen A (2013) A new formulation and an exact approach for the many-to-many hub location-routing problem. Appl Math Modell 37(12–13):7465–7480

  • de Sá E M, de Camargo RS, de Miranda G Jr (2013) An improved benders decomposition algorithm for the tree of hubs location problem. Eur J Oper Res 226 (2):185–202

  • de Sá E M, Contreras I, Cordeau JF, de Camargo RS, de Miranda G Jr (2015) The hub line location problem. Transp Sci 49(3):500–518

  • Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3):139–154

    Article  Google Scholar 

  • Ernst AT, Krishnamoorthy M (1998) An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J Comput 10(2):149–162

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Indus Eng 64(4):1096–1109

    Article  Google Scholar 

  • Fazel-Zarandi MM, Berman O, Beck JC (2013) Solving a stochastic facility location/fleet management problem with logic-based benders’ decomposition. IIE Trans 45(8):896–911

    Article  Google Scholar 

  • Gelareh S, Nickel S (2008) A benders decomposition for hub location problems arising in public transport. Springer, Berlin, pp 129–134

    Google Scholar 

  • Gelareh S, Nickel S (2011) Hub location problems in transportation networks. Transp Res E 47(6):1092–1111

    Article  Google Scholar 

  • Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by benders decomposition. Manag Sci 20(5):822–844

    Article  Google Scholar 

  • He X, Zheng H, Peeta S, Li Y (2018) Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning. Netw Spatial Econ, 1–24. https://doi.org/10.1007/s11067-017-9381-y

  • Ilić A, Urošević D, Brimberg J, Mladenović N (2010) A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res 206(2):289–300

    Article  Google Scholar 

  • Kara BY (1999) Modeling and analysis of issues in hub location problem. Bilkent University, PhD thesis

    Google Scholar 

  • Klincewicz JG (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann Oper Res 40(1):283–302

    Article  Google Scholar 

  • Kratica J, Stanimirović Z, Tošić D, Filipović V (2007) Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res 182(1):15–28

    Article  Google Scholar 

  • Magnanti TL, Wong RT (1981) Accelerating benders decomposition: algorithmic enhancement and model selection criteria. Oper Res 29(3):464–484

    Article  Google Scholar 

  • Marić M, Stanimirović Z, Stanojević P (2013) An efficient memetic algorithm for the uncapacitated single allocation hub location problem. Soft Comput 17(3):445–466

    Article  Google Scholar 

  • Meier JF, Clausen U (2017) Solving single allocation hub location problems on Euclidean data. Transp Sci. https://doi.org/10.1287/trsc.2017.0751

  • Meier JF, Clausen U, Rostami B, Buchheim C (2016) A compact linearisation of euclidean single allocation hub location problems. Electron Notes Discret Math 52:37–44

    Article  Google Scholar 

  • Merakli M, Yaman H (2016) Robust intermodal hub location under polyhedral demand uncertainty. Transp Res B Methodol 86:66–85

    Article  Google Scholar 

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

    Article  Google Scholar 

  • O’Kelly ME (1992) Hub facility location with fixed costs. Pap Reg Sci 71 (3):293–306

    Article  Google Scholar 

  • O’Kelly ME, Luna HPL, de Camargo RS, de Miranda G Jr (2015) Hub location problems with price sensitive demands. Netw Spatial Econ 15(4):917–945

  • Peker M, Kara BY, Campbell JF, Alumur SA (2016) Spatial analysis of single allocation hub location problems. Netw Spatial Econ 16(4):1075–1101

    Article  Google Scholar 

  • Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The benders decomposition algorithm: a literature review. Eur J Oper Res 259(3):801–817

    Article  Google Scholar 

  • Roy TJV (1986) A cross decomposition algorithm for capacitated facility location. Oper Res 34(1):145–163

    Article  Google Scholar 

  • Silva MR, Cunha CB (2009) New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput Oper Res 36 (12):3152–3165

    Article  Google Scholar 

  • Skorin-Kapov D, Skorin-Kapov J (1994) On tabu search for the location of interacting hub facilities. Eur J Oper Res 73(3):502–509

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Tan PZ, Kara BY (2007) A hub covering model for cargo delivery systems. Networks 49(1):28–39

    Article  Google Scholar 

  • Taner MR, Kara BY (2016) Endogenous effects of hubbing on flow intensities. Netw Spatial Econ 16(4):1151–1158

    Article  Google Scholar 

  • Tang L, Jiang W, Saharidis GKD (2013) An improved benders decomposition algorithm for the logistics facility location problem with capacity expansions. Ann Oper Res 210(1):165–190

    Article  Google Scholar 

  • Tang L, Sun D, Liu J (2016) Integrated storage space allocation and ship scheduling problem in bulk cargo terminals. IIE Trans 48(5):428–439

    Article  Google Scholar 

  • Topcuoglu H, Corut F, Ermis M, Yilmaz G (2005) Solving the uncapacitated hub location problem using genetic algorithms. Comput Oper Res 32 (4):967–984

    Article  Google Scholar 

  • Üster H, Agrahari H (2011) A benders decomposition approach for a distribution network design problem with consolidation and capacity considerations. Oper Res Lett 39(2):138–143

    Article  Google Scholar 

  • Üster H, Easwaran G, Akçali E, Çetinkaya S (2007) Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model. Naval Res Logist (NRL) 54(8):890–907

    Article  Google Scholar 

  • Wentges P (1996) Accelerating benders’ decomposition for the capacitated facility location problem. Math Methods Oper Res 44(2):267–290

    Article  Google Scholar 

  • Wolf S, Merz P (2007) Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Hybrid Metaheuristics. Springer, pp 1–15

Download references

Acknowledgments

The authors sincerely thank the two anonymous referees for their valuable and constructive comments that helped us improve the quality and presentation of the paper.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Tabriz, Tabriz, Iran

    Nader Ghaffarinasab

  2. Department of Industrial Engineering, Bilkent University, Ankara, Turkey

    Bahar Y. Kara

Authors
  1. Nader Ghaffarinasab
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bahar Y. Kara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nader Ghaffarinasab.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghaffarinasab, N., Kara, B.Y. Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem. Netw Spat Econ 19, 83–108 (2019). https://doi.org/10.1007/s11067-018-9424-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-018-9424-z

Keywords

Search

Navigation