, 44:57 | Cite as

A P-hub median network design problem with preventive reliability approach for before and after hub failure

  • Alireza EydiEmail author
  • Ramin Nasiri


Hubs are vital elements of communication and transportation networks and play an important role in interchanging the flows of information/passenger/goods. For this purpose, designing a highly reliable hub network is very critical, because inefficiency of even a single hub across the network tends to reduce the efficiency of the whole network in transferring the flow appropriately. In this research, a bi-objective mathematical model was designed to study the situations before and after hub failure. Considering reliability, the first objective was to maximize the flow through the network, and the second objective was to prevent wasting the flow due to a possible hub failure. The lexicographic method was used to solve this multi-objective problem with dependent objectives. This method represents an appropriate solution for problems whose objective functions are of different priorities or depend on one another. Various cases of different sizes were used to evaluate the model in terms of reliability. Since the hub location problem is an NP-Hard problem of commonly large dimensions, a hybrid meta-heuristic algorithm called “memetic algorithm” was used to have it solved. The algorithm was a combination of genetic algorithm with simulated annealing algorithm, where simulated annealing algorithm was used for local neighborhood search. Findings indicated that, consideration of the backup hub tends to enhance route reliability, thereby increasing the flow through the network, as compared to the case with no backup hub.


Hybrid meta-heuristic algorithm hub failure reliability backup hub hub location 


  1. 1.
    Hekmatfar M and Pishvaee M 2009 Hub location problem. In Facility Location. Physica-Verlag Heidelberg, pp. 243–270CrossRefGoogle Scholar
  2. 2.
    Chinchuluun A and Pardalos P M 2007 A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 154(1): 29–50Google Scholar
  3. 3.
    Krasnogor N and Smith J 2005 A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Tran. Evolut. Comput. 9(5): 474–488CrossRefGoogle Scholar
  4. 4.
    Rodríguez V, Alvarez M J and Barcos L 2007 Hub location under capacity constraints. Transp. Res. Part E. Logist. Transp. Rev. 43(5): 495–505Google Scholar
  5. 5.
    Snyder L V and Daskin M S 2005 Reliability models for facility location: the expected failure cost case. Transp. Sci. 39(3): pp. 400–416Google Scholar
  6. 6.
    Berman O, Krass D and Menezes M B 2007 Facility reliability issues in network p-median problems: strategic centralization and co-location effects. Oper. Res. 5(2): 332–350MathSciNetCrossRefGoogle Scholar
  7. 7.
    Zhan R L and Shen Z J M 2007 Models and algorithms for reliable facility location problems and system reliability optimization, Doctoral Dissertation, University of FloridaGoogle Scholar
  8. 8.
    Lim M, Daskin M S, Bassamboo A and Chopra S 2010 A facility reliability problem: Formulation, properties, and algorithm. Naval Res. Logist. 57(1): 58–70MathSciNetzbMATHGoogle Scholar
  9. 9.
    An Y, Zhang Y and Zeng B 2015 The reliable hub-and-spoke design problem: models and algorithms. Transp. Res. Part B Methodol. 77: 103–122CrossRefGoogle Scholar
  10. 10.
    Snyder L V 2006 Facility location under uncertainty: a review. IIE Trans. 38(7): 547–564CrossRefGoogle Scholar
  11. 11.
    Grubesic T H, O’Kelly M E and Murray A T 2003 A geographic perspective on commercial Internet survivability. Telemat. Inform. 20(1): 51–69CrossRefGoogle Scholar
  12. 12.
    Klincewicz J G 1998 Hub location in backbone/tributary network design: a review. Locat. Sci. 6(1–4): 307–335CrossRefGoogle Scholar
  13. 13.
    Skorin-Kapov D, Skorin-Kapov J and O’Kelly M 1996 Tight linear programming relaxation of uncapacitated p-hub median problems. Eur. J. Oper. Res. 94(3): 582–593CrossRefGoogle Scholar
  14. 14.
    O’Kelly M E 2009 Rectilinear minimax hub location problems. J. Geogr. Syst. 11(3): 227–241CrossRefGoogle Scholar
  15. 15.
    Parvaresh F, Husseini S M, Golpayegany S H and Karimi B 2014 Hub network design problem in the presence of disruptions. J. Intell. Manuf. 25(4): 755–774CrossRefGoogle Scholar
  16. 16.
    Hamidi M, Gholamian M and Shahanaghi K 2014 Developing prevention reliability in hub location models. Proc. Inst. Mech. Eng. Part O J. Risk Reliab. 228(4): 337–346Google Scholar
  17. 17.
    Azizi N, Chauhan S, Salhi S and Vidyarthi N 2016 The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques. Comput. Oper. Res. 65: 174–188MathSciNetCrossRefGoogle Scholar
  18. 18.
    Azizi N 2017 Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods. Ann. Oper. Res. 1–27. doi:
  19. 19.
    Eghbali M, Abedzadeh M and Setak M 2014 Multi-objective reliable hub covering location considering customer convenience using NSGA-II. Int. J. Syst. Assur. Eng. Manag. 5(3): 450–460CrossRefGoogle Scholar
  20. 20.
    Zarrinpoor N, Fallahnezhad M S and Pishvaee M S 2018 The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm. Eur J. Oper. Res. 265(3): 1013–1032MathSciNetCrossRefGoogle Scholar
  21. 21.
    Ghezavati V and Hosseinifar P 2018 Application of efficient metaheuristics to solve a new bi-objective optimization model for hub facility location problem considering value at risk criterion. Soft Comput. 22(1): 195–212CrossRefGoogle Scholar
  22. 22.
    Sohn J and Park S 1998 Efficient solution procedure and reduced size formulations for p-hub location problems. Eur. J. Oper. Res. 108(1): 118–126CrossRefGoogle Scholar
  23. 23.
    Contreras I, Díaz J A and Fernández E 2009 Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectr. 31(3): 483–505MathSciNetCrossRefGoogle Scholar
  24. 24.
    O’Kelly M E 1987 A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3): 393–404MathSciNetCrossRefGoogle Scholar
  25. 25.
    Acampora G, Loia V, Salerno S and Vitiello A 2012 A hybrid evolutionary approach for solving the ontology alignment problem. Int. J. Intell. Syst. 27(3): 189–216CrossRefGoogle Scholar
  26. 26.
    Galinier P, Boujbel Z and Fernandes M C 2011 An efficient memetic algorithm for the graph partitioning problem. Ann. Oper. Res. 191(1): 1–22MathSciNetCrossRefGoogle Scholar
  27. 27.
    Neri F, Cotta C and Moscato P (Eds). 2012 Handbook of memetic algorithms (Vol. 379). Heidelberg: SpringerGoogle Scholar
  28. 28.
    Chen J F 2007 A hybrid heuristic for the uncapacitated single allocation hub location problem. Omega 35(2): 211–220CrossRefGoogle Scholar
  29. 29.
    Pradeepmon T G and Paul B 2012 A simulated annealing-based hybrid algorithm for solving UFL problems. Int. J. Appl. Manag. Sci. 4(3): 274–283Google Scholar
  30. 30.
    Saboury A, Ghaffari-Nasab N, Barzinpour F and Jabalameli M S 2013 Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks. Comput. Oper. Res. 40(10): 2493–2507MathSciNetCrossRefGoogle Scholar
  31. 31.
    Mokhtari N and Abbasi M 2015 Applying VNPSO algorithm to solve the many-to-many hub location-routing problem in a large scale. Eur. Online J. Natl Soc. Sci. Proc. 3(4): 647–656Google Scholar
  32. 32.
    Amin-Naseri M R, Yazdekhasti A and Salmasnia A 2018 Robust bi-objective optimization of uncapacitated single allocation p-hub median problem using a hybrid heuristic algorithm. Neural Comput. Appl. 29(9): 511–532CrossRefGoogle Scholar
  33. 33.
    Zhalechian M, Torabi S A and Mohammadi M 2018 Hub-and-spoke network design under operational and disruption risks. Transp. Res. Part E Logist. Transp. Rev. 109: 20–43CrossRefGoogle Scholar
  34. 34.
    Mogale D G, Kumar S K and Tiwari M K 2016 Two-stage Indian food grain supply chain network transportation-allocation model. IFAC-PapersOnLine 49(12): 1767–1772CrossRefGoogle Scholar
  35. 35.
    Kartal Z, Hasgul and Ernst A T 2017 Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery. Transp. Res. Part E Logist. Transp. Rev. 108: 141–159CrossRefGoogle Scholar
  36. 36.
    Bashiri M, Rezanezhad M, Tavakkoli-Moghaddam R and Hasanzadeh H 2018 Mathematical modeling for ap-mobile hub location problem in a dynamic environment by a genetic algorithm. Appl. Math. Modell. 54: 151–169MathSciNetCrossRefGoogle Scholar
  37. 37.
    Mogale D G, Kumar M, Kumar S K and Tiwari M K 2018 Grain silo location-allocation problem with dwell time for optimization of food grain supply chain network. Transp. Res. Part E Logist. Transp. Rev. 111: 40–69CrossRefGoogle Scholar
  38. 38.
    Mogale D G, Kumar S K and Tiwari M K 2018 An MINLP model to support the movement and storage decisions of the Indian food grain supply chain. Control Eng. Pract. 70: 98–113CrossRefGoogle Scholar
  39. 39.
    Maiyar L M and Thakkar J J 2017 A combined tactical and operational deterministic food grain transportation model: Particle swarm based optimization approach. Comput. Ind. Eng. 110: 30–42CrossRefGoogle Scholar
  40. 40.
    Mogale D G, Kumar S K, Márquez F P G and Tiwari M K 2017 Bulk wheat transportation and storage problem of public distribution system. Comput. Ind. Eng. 104: 80–97CrossRefGoogle Scholar
  41. 41.
    Fishburn P C 1974 Exceptional paper—Lexicographic orders, utilities and decision rules: A survey. Manag. Sci. 20(11): 1442–1471CrossRefGoogle Scholar

Copyright information

© Indian Academy of Sciences 2019

Authors and Affiliations

  1. 1.Faculty of EngineeringUniversity of KurdistanSanandajIran
  2. 2.University of KurdistanSanandajIran

Personalised recommendations