IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v312y2024i3p954-968.html
   My bibliography  Save this article

A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands

Author

Listed:
  • Andaryan, Abdullah Zareh
  • Mousighichi, Kasra
  • Ghaffarinasab, Nader

Abstract

Hubs are critical components of transportation and distribution systems, and hub networks play a special role in freight and passenger transportation services worldwide. This paper studies a capacitated single allocation hub location problem with Bernoulli demands. Since the origin-destination (OD) demands are stochastic in nature, and the nodes are allocated to hubs before knowing their realized values, the actual total demand allocated to each hub is uncertain. Therefore, demand can exceed the capacity of hubs, rendering a need for outsourcing. The problem is studied under two distinct outsourcing policies, namely the facility and customer outsourcing. Mathematical models are developed for each case as two-stage stochastic programs. Deterministic equivalent formulations are obtained for problems, assuming a homogeneous demand distribution for all OD pairs. A Tabu Search-based algorithm is presented as a solution approach to deal with large problem instances. Extensive computational tests demonstrate the outstanding performance of the developed models and the metaheuristic procedure in terms of solution quality and computational time. The relevance of using stochastic programming approach for the problems is demonstrated via computational results. This study also reports solutions for problems with 200 nodes for the first time.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:312:y:2024:i:3:p:954-968
    DOI: 10.1016/j.ejor.2023.07.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723005532
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.07.015?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. 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.
    2. 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.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. 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.
    5. 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.
    6. 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.
    7. Ishfaq, Rafay & Sox, Charles R., 2012. "Design of intermodal logistics networks with hub delays," European Journal of Operational Research, Elsevier, vol. 220(3), pages 629-641.
    8. Albareda-Sambola, Maria & Fernandez, Elena & Laporte, Gilbert, 2007. "Heuristic and lower bound for a stochastic location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 940-955, June.
    9. Herrera, F. & Verdegay, J. L., 1995. "Three models of fuzzy integer linear programming," European Journal of Operational Research, Elsevier, vol. 83(3), pages 581-593, June.
    10. 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.
    11. Berman, Oded & Drezner, Zvi & Wesolowsky, George O., 2007. "The transfer point location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 978-989, June.
    12. Wasner, Michael & Zapfel, Gunther, 2004. "An integrated multi-depot hub-location vehicle routing model for network planning of parcel service," International Journal of Production Economics, Elsevier, vol. 90(3), pages 403-419, August.
    13. Milorad Vidović & Slobodan Zečević & Milorad Kilibarda & Jelena Vlajić & Nenad Bjelić & Snežana Tadić, 2011. "The p-hub Model with Hub-catchment Areas, Existing Hubs, and Simulation: A Case Study of Serbian Intermodal Terminals," Networks and Spatial Economics, Springer, vol. 11(2), pages 295-314, June.
    14. 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.
    15. 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.
    16. Kaya, Onur, 2011. "Outsourcing vs. in-house production: a comparison of supply chain contracts with effort dependent demand," Omega, Elsevier, vol. 39(2), pages 168-178, April.
    17. Selim Çetiner & Canan Sepil & Haldun Süral, 2010. "Hubbing and routing in postal delivery systems," Annals of Operations Research, Springer, vol. 181(1), pages 109-124, December.
    18. 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).
    19. Maria Albareda-Sambola & Elena Fernández & Francisco Saldanha-da-Gama, 2017. "Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 737-753, November.
    20. 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.
    21. Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2018. "A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities," Omega, Elsevier, vol. 74(C), pages 122-134.
    22. Zhang, Haifeng & Yang, Kai & Gao, Yuan & Yang, Lixing, 2022. "Accelerating Benders decomposition for stochastic incomplete multimodal hub location problem in many-to-many transportation and distribution systems," International Journal of Production Economics, Elsevier, vol. 248(C).
    23. 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.
    24. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    Full references (including those not matched with items on IDEAS)

    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. 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).
    2. 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.
    3. Domínguez-Bravo, Carmen-Ana & Fernández, Elena & Lüer-Villagra, Armin, 2024. "Hub location with congestion and time-sensitive demand," European Journal of Operational Research, Elsevier, vol. 316(3), pages 828-844.
    4. 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.
    5. 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.
    6. 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).
    7. Marc Janschekowitz & Gita Taherkhani & Sibel A. Alumur & Stefan Nickel, 2023. "An alternative approach to address uncertainty in hub location," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 359-393, June.
    8. Zhang, Haifeng & Yang, Kai & Gao, Yuan & Yang, Lixing, 2022. "Accelerating Benders decomposition for stochastic incomplete multimodal hub location problem in many-to-many transportation and distribution systems," International Journal of Production Economics, Elsevier, vol. 248(C).
    9. Silva, Marcos Roberto & Cunha, Claudio B., 2017. "A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 954-965.
    10. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    11. Basallo-Triana, Mario José & Bravo-Bastidas, Juan José & Contreras, Ivan & Cordeau, Jean-François & Vidal-Holguín, Carlos Julio, 2023. "Intermodal hub network design with generalized capacity constraints and non-synchronized train–truck operations," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    12. Ghaffarinasab, Nader & Kara, Bahar Y. & Campbell, James F., 2022. "The stratified p-hub center and p-hub maximal covering problems," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 120-148.
    13. Guillot, Matthieu & Rey, David & Furno, Angelo & El Faouzi, Nour-Eddin, 2024. "A stochastic hub location and fleet assignment problem for the design of reconfigurable park-and-ride systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    14. Trung Hieu Tran & Jesse R. O’Hanley & M. Paola Scaparra, 2017. "Reliable Hub Network Design: Formulation and Solution Techniques," Transportation Science, INFORMS, vol. 51(1), pages 358-375, February.
    15. Azizi, Nader & Salhi, Said, 2022. "Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor," European Journal of Operational Research, Elsevier, vol. 298(3), pages 834-854.
    16. Aloullal, Afaf & Saldanha-da-Gama, Francisco & Todosijević, Raca, 2023. "Multi-period single-allocation hub location-routing: Models and heuristic solutions," European Journal of Operational Research, Elsevier, vol. 310(1), pages 53-70.
    17. Jayaswal, Sachin & Vidyarthi, Navneet, 2023. "Multiple allocation hub location with service level constraints for two shipment classes," European Journal of Operational Research, Elsevier, vol. 309(2), pages 634-655.
    18. 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.
    19. Wu, Yuehui & Qureshi, Ali Gul & Yamada, Tadashi, 2022. "Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1113-1127.
    20. Nazmi Sener & Orhan Feyzioglu, 2023. "Multiple allocation hub covering flow problem under uncertainty," Annals of Operations Research, Springer, vol. 320(2), pages 975-997, January.

    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:eee:ejores:v:312:y:2024:i:3:p:954-968. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.