Skip to main content
SpringerLink
Log in

The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

The hub location problem (HLP) concerns the location of hub nodes and allocation of other non-hub nodes to hubs in the network. Hubs are particular facilities that serve as mediators through the aggregation, consolidation, classification and distribution of network flows from origin to destination. Most models use constant penalty parameters to calculate the aggregation and distribution cost in the objective function. The selected parameter values can significantly affect the number of hubs and their locations in the network. Furthermore, most studies on HLP assume that network hubs are always operational but every established hub has the potential to fail during use. In this paper, we propose the capacitated modular single allocation hub location problem with possibilities of hub disruptions, whereby a low number of capacitated transportation vehicles is used instead of constant parameters. The problem is modeled as a two-stage stochastic program, and a metaheuristic algorithm based on the adaptive large neighbourhood search is proposed. The computational experiment results demonstrate the high efficiency of the proposed solution method.

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
Fig. 3

Similar content being viewed by others

Notes

  1. Civil Aeronautics Board.

References

  • Adibi A, Razmi J (2015) 2-Stage stochastic programming approach for hub location problem under uncertainty: a case study of air network of Iran. J Air Transp Manag 47:172–178

    Article  Google Scholar 

  • Adulyasak Y, Cordeau JF, Jans R (2012) Optimization-based adaptive large neighborhood search for the production routing problem. Transp Sci 48(1):20–45

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Alumur SA, Nickel S, Saldanha-da-Gama F (2012) Hub location under uncertainty. Transp Res Part B 46:529–543

    Article  Google Scholar 

  • Azizi N, Chauhan S, Salhi S, Vidyarthi N (2016) The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques. Comput Oper Res 65:174–188

    Article  Google Scholar 

  • Bakkehaug R, Rakke JG, Fagerholt K, Laporte G (2016) An adaptive large neighborhood search heuristic for fleet deployment problems with voyage separation requirements. Transp Res Part C Emerg Technol 70:129–141

    Article  Google Scholar 

  • Ben-Ayed O (2013) Parcel distribution network design problem. Oper Res Int J 13(2):211–232

    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 

  • Canca D, De-Los-Santos A, Laporte G, Mesa JA (2017) An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem. Comput Oper Res 78:1–14

    Article  Google Scholar 

  • Chaharsooghi S, Momayezi F, Ghaffarinasab N (2017) An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions. Int J Ind Eng Comput 8(2):191–202

    Google Scholar 

  • Coelho LC, Cordeau JF, Laporte G (2012a) Consistency in multi-vehicle inventory-routing. Transp Res Part C Emerg Technol 24:270–287

    Article  Google Scholar 

  • Coelho LC, Cordeau JF, Laporte G (2012b) The inventory-routing problem with transshipment. Comput Oper Res 39(11):2537–2548

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Correia I, Nickel S, Saldanha-da-Gama F (2010) The capacitated single-allocation hub location problem revisited: a note on a classical formulation. Eur J Oper Res 207(1):92–96

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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 (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann Oper Res 86: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 Ind Eng 64(4):1096–1109

    Article  Google Scholar 

  • Ghaffari-Nasab N, Ghazanfari M, Teimoury E (2015) Robust optimization approach to the design of hub-and-spoke networks. Int J Adv Manuf Technol 76(5–8):1091–1110

    Article  Google Scholar 

  • Goldman AJ (1969) Optimal locations for centers in a network. Transp Sci 3(4):352–360

    Article  Google Scholar 

  • Grangier P, Gendreau M, Lehuédé F, Rousseau LM (2016) An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur J Oper Res 254(1):80–91

    Article  Google Scholar 

  • Hakimi SL, Maheshwari SN (1972) Optimum locations of centers in networks. Oper Res 20(5):967–973

    Article  Google Scholar 

  • Hoff A, Peiró J, Corberán Á, Martí R (2017) Heuristics for the capacitated modular hub location problem. Comput Oper Res 86:94–109

    Article  Google Scholar 

  • Horner MW, O’Kelly ME (2001) Embedding economies of scale concepts for hub network design. J Transp Geogr 9(4):255–265

    Article  Google Scholar 

  • Hult E, Jiang H, Ralph D (2014) Exact computational approaches to a stochastic uncapacitated single allocation p-hub center problem. Comput Optim Appl 59(1-2):185–200

    Article  Google Scholar 

  • Laporte G, Musmanno R, Vocaturo F (2010) An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transp Sci 44(1):125–135

    Article  Google Scholar 

  • Lei TL (2013) Identifying critical facilities in hub-and-spoke networks: a hub interdiction median problem. Geogr Anal 45(2):105–122

    Article  Google Scholar 

  • Lim MK, Bassamboo A, Chopra S, Daskin MS (2013) Facility location decisions with random disruptions and imperfect estimation. Manuf Serv Oper Manag 15(2):239–249

    Article  Google Scholar 

  • Lusby RM, Schwierz M, Range TM, Larsen J (2016) An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem. Artif Intell Med 74:21–31

    Article  Google Scholar 

  • Marianov V, Serra D (2003) Location models for airline hubs behaving as M/D/c queues. Comput Oper Res 30(7):983–1003

    Article  Google Scholar 

  • Marks D (1969) An optimal algorithm for a capacitated warehouse transshipment problem, Ph.D. dissertation, Johns Hopkins University, Baltimore

  • Mauri GR, Ribeiro GM, Lorena LAN, Laporte G (2016) An adaptive large neighborhood search for the discrete and continuous Berth allocation problem. Comput Oper Res 70:140–154

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Miškovic S, Stanimirovic Z (2017) A hybrid metaheuristic method for the deterministic and robust uncapacitated multiple allocation p-hub centre problem. Eur J Ind Eng 11(5):631–662

    Article  Google Scholar 

  • Mohammadi M, Tavakkoli-Moghaddam R (2016) Design of a fuzzy bi-objective reliable p-hub center problem. J Intell Fuzzy Syst 30(5):2563–2580

    Article  Google Scholar 

  • Mohammadi M, Tavakkoli-Moghaddam R, Siadat A, Dantan JY (2016) Design of a reliable logistics network with hub disruption under uncertainty. Appl Math Model 40(9):5621–5642

    Article  Google Scholar 

  • O’Kelly ME (2015) Network hub structure and resilience. Netw Spat Econ 15(2):235–251

    Article  Google Scholar 

  • O’Kelly ME (1986a) Activity levels at hub facilities in interacting networks. Geogr Anal 18(4):343–356

    Article  Google Scholar 

  • O’kelly ME (1986b) The location of interacting hub facilities. Transp Sci 20(2):92–106

    Article  Google Scholar 

  • Parvaresh F, Golpayegany SH, Husseini SM, Karimi B (2013) Solving the p-hub median problem under intentional disruptions using simulated annealing. Netw Spat Econ 13(4):445–470

    Article  Google Scholar 

  • Parvaresh F, Husseini SM, Golpayegany SH, Karimi B (2014) Hub network design problem in the presence of disruptions. J Intell Manuf 25(4):755–774

    Article  Google Scholar 

  • Ribeiro GM, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 39(3):728–735

    Article  Google Scholar 

  • Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455–472

    Article  Google Scholar 

  • Rostami B, Kämmerling N, Buchheim C, Clausen U (2018) Reliable single allocation hub location problem under hub breakdowns. Comput Oper Res 96:15–29

    Article  Google Scholar 

  • Shahabi M, Unnikrishnan A (2014) Robust hub network design problem. Transp Res Part E Logist Transp Rev 70:356–373

    Article  Google Scholar 

  • Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: International conference on principles and practice of constraint programming. Springer, Berlin, pp 417–431

  • Shen ZJM, Zhan RL, Zhang J (2011) The reliable facility location problem: formulations, heuristics, and approximation algorithms. INFORMS J Comput 23(3):470–482

    Article  Google Scholar 

  • Sim T, Lowe TJ, Thomas BW (2009) The stochastic p-hub center problem with service-level constraints. Comput Oper Res 36(12):3166–3177

    Article  Google Scholar 

  • Siwczyk T, Engell S (2016) Solving two-stage stochastic mixed-integer linear problems by ordinal optimization and evolutionary algorithms. In: Evolutionary computation (CEC), 2016 IEEE congress on IEEE, pp 2836–2843

  • 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 

  • Snyder LV, Daskin MS (2005) Reliability models for facility location: the expected failure cost case. Transp Sci 39(3):400–416

    Article  Google Scholar 

  • Snyder LV, Daskin MS (2007) Models for reliable supply chain network design. In: Murray AT, Grubesic TH (eds) Reliability and vulnerability in critical infrastructure: a quantitative geographic perspective, vol 13. Springer, New York, pp 257–289

    Chapter  Google Scholar 

  • Snyder LV, Atan Z, Peng P, Rong Y, Schmitt AJ, Sinsoysal B (2016) OR/MS models for supply chain disruptions: a review. IIE Trans 48(2):89–109

    Article  Google Scholar 

  • Stanojević P, Marić M, Stanimirović Z (2015) A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem. Appl Soft Comput 33:24–36

    Article  Google Scholar 

  • Taghipourian F, Mahdavi I, Mahdavi-Amiri N, Makui A (2012) A fuzzy programming approach for dynamic virtual hub location problem. Appl Math Model 36(7):3257–3270

    Article  Google Scholar 

  • Tanash M, Contreras I, Vidyarthi N (2017) An exact algorithm for the modular hub location problem with single assignments. Comput Oper Res 85:32–44

    Article  Google Scholar 

  • Yaman H (2008) Star p-hub median problem with modular arc capacities. Comput Oper Res 35(9):3009–3019

    Article  Google Scholar 

  • Yaman H (2011) Allocation strategies in hub networks. Eur J Oper Res 211(3):442–451

    Article  Google Scholar 

  • Yang T (2009) Stochastic air freight hub location and flight routes planning. Appl Math Model 33:4424–4430

    Article  Google Scholar 

  • Yang K, Liu Y, Yang G (2013a) An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem. Comput Ind Eng 64(1):133–142

    Article  Google Scholar 

  • Yang K, Liu YK, Yang GQ (2013b) Solving fuzzy p-hub center problem by genetic algorithm incorporating local search. Appl Soft Comput 13(5):2624–2632

    Article  Google Scholar 

  • Yang K, Liu Y, Yang G (2014) Optimizing fuzzy p-hub center problem with generalized value-at-risk criterion. Appl Math Model 38(15–16):3987–4005

    Article  Google Scholar 

  • Zetina CA, Contreras I, Cordeau JF, Nikbakhsh E (2017) Robust uncapacitated hub location. Transp Res Part B Methodol 106:393–410

    Article  Google Scholar 

  • Zhai H, Liu Y, Chen W (2012) Applying minimum-risk criterion to stochastic hub location problems. Proc Eng 29:2313–2321

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Tarbiat Moddares University, Jalal Al Ahmad Street, No. 7, Tehran, Iran

    Farid Momayezi, S. Kamal Chaharsooghi, Mohammad Mehdi Sepehri & Ali Husseinzadeh Kashan

Authors
  1. Farid Momayezi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Kamal Chaharsooghi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammad Mehdi Sepehri
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ali Husseinzadeh Kashan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Kamal Chaharsooghi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Momayezi, F., Chaharsooghi, S.K., Sepehri, M.M. et al. The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm. Oper Res Int J 21, 139–166 (2021). https://doi.org/10.1007/s12351-018-0438-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-018-0438-6

Keywords

Search

Navigation