IDEAS home Printed from https://ideas.repec.org/a/eee/jaitra/v68y2018icp118-136.html
   My bibliography  Save this article

A bi-objective, reliable single allocation p-hub maximal covering location problem: Mathematical formulation and solution approach

Author

Listed:
  • Madani, Seyed Reza
  • Shahandeh Nookabadi, Ali
  • Hejazi, Seyed Reza

Abstract

In the last few years, the p-hub maximal covering problem (pHMCP) has been applied in a variety of applications, including the design of air transportation networks, distribution systems for perishable products, postal delivery networks, and tourism routing. In hub-based systems, disruptions at hubs or unavailability of routes significantly affect service level and result in excessive costs. To tackle these problems, selecting backup hubs for unavailable hubs and rerouting the related flows are often proposed. This paper develops a bi-objective reliable single allocation p-hub maximal covering problem (BRSApHMCP) considering two objectives: maximizing expected covered flows and minimizing congestion. After formulating an initial non-linear model, a linear model is presented; the NP-Completeness of the developed model is proved and a non-dominated sorting genetic algorithm (NSGA-II) is proposed to solve it. In order to show the superior performance of the proposed NSGA-II, a well-known evolutionary algorithm, the multi-objective particle swarm optimization (MOPSO), and the epsilon constraint methods are utilized and the results are analyzed and compared. The parameters of the proposed algorithms are calibrated using the Taguchi approach. Also, a case study and some parametric analyses are done. The results show that NSGA-II is able to find the better solutions in comparison with MOPSO and by opting this proactive strategy in the investigated case study, NSGA-II could recover up to 73% of lost flow in a well-balanced system.

Suggested Citation

  • Madani, Seyed Reza & Shahandeh Nookabadi, Ali & Hejazi, Seyed Reza, 2018. "A bi-objective, reliable single allocation p-hub maximal covering location problem: Mathematical formulation and solution approach," Journal of Air Transport Management, Elsevier, vol. 68(C), pages 118-136.
    • Handle: RePEc:eee:jaitra:v:68:y:2018:i:c:p:118-136
    DOI: 10.1016/j.jairtraman.2017.09.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0969699717300194
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jairtraman.2017.09.001?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. Mark S. Daskin, 1983. "A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution," Transportation Science, INFORMS, vol. 17(1), pages 48-70, February.
    2. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    3. An, Yu & Zhang, Yu & Zeng, Bo, 2015. "The reliable hub-and-spoke design problem: Models and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 103-122.
    4. Tingting Cui & Yanfeng Ouyang & Zuo-Jun Max Shen, 2010. "Reliable Facility Location Design Under the Risk of Disruptions," Operations Research, INFORMS, vol. 58(4-part-1), pages 998-1011, August.
    5. Janić, Milan, 2015. "Reprint of “Modelling the resilience, friability and costs of an air transport network affected by a large-scale disruptive event”," Transportation Research Part A: Policy and Practice, Elsevier, vol. 81(C), pages 77-92.
    6. B Wagner, 2008. "Model formulations for hub covering problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 932-938, July.
    7. Stone, Matthew J., 2016. "Reliability as a factor in small community air passenger choice," Journal of Air Transport Management, Elsevier, vol. 53(C), pages 161-164.
    8. O'kelly, Morton E., 1987. "A quadratic integer program for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 32(3), pages 393-404, December.
    9. Marufuzzaman, Mohammad & Eksioglu, Sandra D. & Li, Xiaopeng & Wang, Jin, 2014. "Analyzing the impact of intermodal-related risk to the design and management of biofuel supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 122-145.
    10. 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.
    11. Morton E. O'Kelly, 1986. "The Location of Interacting Hub Facilities," Transportation Science, INFORMS, vol. 20(2), pages 92-106, May.
    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. Peker, Meltem & Kara, Bahar Y., 2015. "The P-Hub maximal covering problem and extensions for gradual decay functions," Omega, Elsevier, vol. 54(C), pages 158-172.
    14. 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.
    15. 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.
    16. B Y Kara & B C Tansel, 2003. "The single-assignment hub covering problem: Models and linearizations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 59-64, January.
    17. Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
    18. Cui, Tingting & Ouyang, Yanfeng & Shen, Zuo-Jun Max J, 2010. "Reliable Facility Location Design under the Risk of Disruptions," University of California Transportation Center, Working Papers qt5sh2c7pw, University of California Transportation Center.
    19. 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.
    20. Janić, Milan, 2015. "Modelling the resilience, friability and costs of an air transport network affected by a large-scale disruptive event," Transportation Research Part A: Policy and Practice, Elsevier, vol. 71(C), pages 1-16.
    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. Ramamoorthy, Prasanna & Vidyarthi, Navneet & Verma, Manish, 2024. "Efficient solution approaches for the bi-criteria p-hub median and dispersion problem," European Journal of Operational Research, Elsevier, vol. 314(1), pages 79-93.
    2. 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).
    3. Jian Zhou & Kexin Xu & Yuxiu Zhao & Haoran Zheng & Zhengnan Dong, 2021. "Hub-and-Spoke Logistics Network Considering Pricing and Co-Opetition," Sustainability, MDPI, vol. 13(17), pages 1-21, September.

    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. 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.
    2. Mohammad Marufuzzaman & Sandra Duni Ekşioğlu, 2017. "Designing a Reliable and Dynamic Multimodal Transportation Network for Biofuel Supply Chains," Transportation Science, INFORMS, vol. 51(2), pages 494-517, May.
    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. 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.
    5. Cheng, Chun & Qi, Mingyao & Zhang, Ying & Rousseau, Louis-Martin, 2018. "A two-stage robust approach for the reliable logistics network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 185-202.
    6. Mengshi Lu & Lun Ran & Zuo-Jun Max Shen, 2015. "Reliable Facility Location Design Under Uncertain Correlated Disruptions," Manufacturing & Service Operations Management, INFORMS, vol. 17(4), pages 445-455, October.
    7. O’Hanley, Jesse R. & Scaparra, M. Paola & García, Sergio, 2013. "Probability chains: A general linearization technique for modeling reliability in facility location and related problems," European Journal of Operational Research, Elsevier, vol. 230(1), pages 63-75.
    8. An, Shi & Cui, Na & Bai, Yun & Xie, Weijun & Chen, Mingliu & Ouyang, Yanfeng, 2015. "Reliable emergency service facility location under facility disruption, en-route congestion and in-facility queuing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 199-216.
    9. Yun Bai & Xiaopeng Li & Fan Peng & Xin Wang & Yanfeng Ouyang, 2015. "Effects of Disruption Risks on Biorefinery Location Design," Energies, MDPI, vol. 8(2), pages 1-19, February.
    10. 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.
    11. Sushil Poudel & Mohammad Marufuzzaman & Md Abdul Quddus & Sudipta Chowdhury & Linkan Bian & Brian Smith, 2018. "Designing a Reliable and Congested Multi-Modal Facility Location Problem for Biofuel Supply Chain Network," Energies, MDPI, vol. 11(7), pages 1-24, June.
    12. Robert Aboolian & Tingting Cui & Zuo-Jun Max Shen, 2013. "An Efficient Approach for Solving Reliable Facility Location Models," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 720-729, November.
    13. Majbah Uddin & Nathan Huynh, 2019. "Reliable Routing of Road-Rail Intermodal Freight under Uncertainty," Networks and Spatial Economics, Springer, vol. 19(3), pages 929-952, September.
    14. Fadda, Edoardo & Manerba, Daniele & Tadei, Roberto, 2024. "How to locate services optimizing redundancy: A comparative analysis of K-Covering Facility Location models," Socio-Economic Planning Sciences, Elsevier, vol. 94(C).
    15. Zhixue Liu & Shukun Wang & Yanfeng Ouyang, 2017. "Reliable Biomass Supply Chain Design under Feedstock Seasonality and Probabilistic Facility Disruptions," Energies, MDPI, vol. 10(11), pages 1-18, November.
    16. Salimi, F. & Vahdani, Behnam, 2018. "Designing a bio-fuel network considering links reliability and risk-pooling effect in bio-refineries," Reliability Engineering and System Safety, Elsevier, vol. 174(C), pages 96-107.
    17. Marufuzzaman, Mohammad & Eksioglu, Sandra D. & Li, Xiaopeng & Wang, Jin, 2014. "Analyzing the impact of intermodal-related risk to the design and management of biofuel supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 122-145.
    18. Azad, Nader & Hassini, Elkafi, 2019. "Recovery strategies from major supply disruptions in single and multiple sourcing networks," European Journal of Operational Research, Elsevier, vol. 275(2), pages 481-501.
    19. An, Shi & Cui, Na & Li, Xiaopeng & Ouyang, Yanfeng, 2013. "Location planning for transit-based evacuation under the risk of service disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 54(C), pages 1-16.
    20. Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2021. "Robust facility location under demand uncertainty and facility disruptions," Omega, Elsevier, vol. 103(C).

    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:jaitra:v:68:y:2018:i:c:p:118-136. 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.journals.elsevier.com/journal-of-air-transport-management/ .

    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.