IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v21y2021i1d10.1007_s12351-018-0438-6.html
   My bibliography  Save this article

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

Author

Listed:
  • Farid Momayezi

    (Tarbiat Moddares University)

  • S. Kamal Chaharsooghi

    (Tarbiat Moddares University)

  • Mohammad Mehdi Sepehri

    (Tarbiat Moddares University)

  • Ali Husseinzadeh Kashan

    (Tarbiat Moddares University)

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.

Suggested Citation

  • Farid Momayezi & S. Kamal Chaharsooghi & Mohammad Mehdi Sepehri & Ali Husseinzadeh Kashan, 2021. "The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm," Operational Research, Springer, vol. 21(1), pages 139-166, March.
    • Handle: RePEc:spr:operea:v:21:y:2021:i:1:d:10.1007_s12351-018-0438-6
    DOI: 10.1007/s12351-018-0438-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-018-0438-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-018-0438-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Grangier, Philippe & Gendreau, Michel & Lehuédé, Fabien & Rousseau, Louis-Martin, 2016. "An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization," European Journal of Operational Research, Elsevier, vol. 254(1), pages 80-91.
    2. Zetina, Carlos Armando & Contreras, Ivan & Cordeau, Jean-François & Nikbakhsh, Ehsan, 2017. "Robust uncapacitated hub location," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 393-410.
    3. Shahabi, Mehrdad & Unnikrishnan, Avinash, 2014. "Robust hub network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 356-373.
    4. Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2010. "The capacitated single-allocation hub location problem revisited: A note on a classical formulation," European Journal of Operational Research, Elsevier, vol. 207(1), pages 92-96, November.
    5. F. Parvaresh & S. Hashemi Golpayegany & S. Moattar Husseini & B. Karimi, 2013. "Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing," Networks and Spatial Economics, Springer, vol. 13(4), pages 445-470, December.
    6. Edward Hult & Houyuan Jiang & Daniel Ralph, 2014. "Exact computational approaches to a stochastic uncapacitated single allocation p-hub center problem," Computational Optimization and Applications, Springer, vol. 59(1), pages 185-200, October.
    7. Gilbert Laporte & Roberto Musmanno & Francesca Vocaturo, 2010. "An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 44(1), pages 125-135, February.
    8. Meraklı, Merve & Yaman, Hande, 2016. "Robust intermodal hub location under polyhedral demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 86(C), pages 66-85.
    9. Campbell, James F., 1994. "Integer programming formulations of discrete hub location problems," European Journal of Operational Research, Elsevier, vol. 72(2), pages 387-405, January.
    10. A.T. Ernst & M. Krishnamoorthy, 1999. "Solution algorithms for the capacitated single allocation hub location problem," Annals of Operations Research, Springer, vol. 86(0), pages 141-159, January.
    11. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    12. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    13. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    14. Adibi, Ali & Razmi, Jafar, 2015. "2-Stage stochastic programming approach for hub location problem under uncertainty: A case study of air network of Iran," Journal of Air Transport Management, Elsevier, vol. 47(C), pages 172-178.
    15. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    16. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.
    17. Michael K. Lim & Achal Bassamboo & Sunil Chopra & Mark S. Daskin, 2013. "Facility Location Decisions with Random Disruptions and Imperfect Estimation," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 239-249, May.
    18. Contreras, Ivan & Cordeau, Jean-François & Laporte, Gilbert, 2011. "Stochastic uncapacitated hub location," European Journal of Operational Research, Elsevier, vol. 212(3), pages 518-528, August.
    19. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    20. A. J. Goldman, 1969. "Optimal Locations for Centers in a Network," Transportation Science, INFORMS, vol. 3(4), pages 352-360, November.
    21. Zuo-Jun Max Shen & Roger Lezhou Zhan & Jiawei Zhang, 2011. "The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 470-482, August.
    22. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka & O'Kelly, Morton, 1996. "Tight linear programming relaxations of uncapacitated p-hub median problems," European Journal of Operational Research, Elsevier, vol. 94(3), pages 582-593, November.
    23. Lawrence V. Snyder & Mark S. Daskin, 2007. "Models for Reliable Supply Chain Network Design," Advances in Spatial Science, in: Alan T. Murray & Tony H. Grubesic (ed.), Critical Infrastructure, chapter 13, pages 257-289, Springer.
    24. S. L. Hakimi & S. N. Maheshwari, 1972. "Optimum Locations of Centers in Networks," Operations Research, INFORMS, vol. 20(5), pages 967-973, October.
    25. Lusby, Richard Martin & Schwierz, Martin & Range, Troels Martin & Larsen, Jesper, 2016. "An Adaptive Large Neighbourhood Search Procedure Applied to the Dynamic Patient Admission Scheduling Problem," Discussion Papers on Economics 1/2016, University of Southern Denmark, Department of Economics.
    26. Lawrence V. Snyder & Zümbül Atan & Peng Peng & Ying Rong & Amanda J. Schmitt & Burcu Sinsoysal, 2016. "OR/MS models for supply chain disruptions: a review," IISE Transactions, Taylor & Francis Journals, vol. 48(2), pages 89-109, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jinzhong Zhang & Tan Zhang & Gang Zhang & Min Kong, 2023. "Parameter optimization of PID controller based on an enhanced whale optimization algorithm for AVR system," Operational Research, Springer, vol. 23(3), pages 1-26, September.
    2. Rahmati, Reza & Neghabi, Hossein & Bashiri, Mahdi & Salari, Majid, 2023. "Stochastic regional-based profit-maximizing hub location problem: A sustainable overview," Omega, Elsevier, vol. 121(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hu, Qing-Mi & Hu, Shaolong & Wang, Jian & Li, Xiaoping, 2021. "Stochastic single allocation hub location problems with balanced utilization of hub capacities," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 204-227.
    2. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    3. Ghaffarinasab, Nader & Kara, Bahar Y., 2022. "A conditional β-mean approach to risk-averse stochastic multiple allocation hub location problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    4. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    5. Rostami, Borzou & Kämmerling, Nicolas & Naoum-Sawaya, Joe & Buchheim, Christoph & Clausen, Uwe, 2021. "Stochastic single-allocation hub location," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1087-1106.
    6. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.
    7. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    8. Mohammadi, Mehrdad & Jula, Payman & Tavakkoli-Moghaddam, Reza, 2019. "Reliable single-allocation hub location problem with disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 90-120.
    9. Nader Azizi, 2019. "Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods," Annals of Operations Research, Springer, vol. 272(1), pages 159-185, January.
    10. Zhalechian, M. & Torabi, S. Ali & Mohammadi, M., 2018. "Hub-and-spoke network design under operational and disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 20-43.
    11. Rahmati, Reza & Neghabi, Hossein & Bashiri, Mahdi & Salari, Majid, 2023. "Stochastic regional-based profit-maximizing hub location problem: A sustainable overview," Omega, Elsevier, vol. 121(C).
    12. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    13. Ghaffarinasab, Nader & Çavuş, Özlem & Kara, Bahar Y., 2023. "A mean-CVaR approach to the risk-averse single allocation hub location problem with flow-dependent economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 32-53.
    14. Zhongfeng Qin & Yuan Gao, 2017. "Uncapacitated $$p$$ p -hub location problem with fixed costs and uncertain flows," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 705-716, March.
    15. Juanjo Peiró & Ángel Corberán & Rafael Martí & Francisco Saldanha-da-Gama, 2019. "Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems," Transportation Science, INFORMS, vol. 53(4), pages 1126-1149, July.
    16. Nader Azizi & Navneet Vidyarthi & Satyaveer S. Chauhan, 2018. "Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 264(1), pages 1-40, May.
    17. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    18. F. Parvaresh & S. Hashemi Golpayegany & S. Moattar Husseini & B. Karimi, 2013. "Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing," Networks and Spatial Economics, Springer, vol. 13(4), pages 445-470, December.
    19. Milad Keshvari Fard & Laurent Alfandari, 2018. "Trade-offs between the Stepwise Cost Function and its Linear Approximation for the Modular Hub Location Problem," Working Papers hal-01821280, HAL.
    20. Ghaffarinasab, Nader & Motallebzadeh, Alireza, 2018. "Hub interdiction problem variants: Models and metaheuristic solution algorithms," European Journal of Operational Research, Elsevier, vol. 267(2), pages 496-512.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:operea:v:21:y:2021:i:1:d:10.1007_s12351-018-0438-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.