Networks and Spatial Economics

, Volume 13, Issue 4, pp 445–470 | Cite as

Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing

  • F. Parvaresh
  • S. A. Hashemi Golpayegany
  • S. M. Moattar Husseini
  • B. Karimi


Hubs are special facilities designed to act as switching, transshipment and sorting points in various distribution systems. Since hub facilities concentrate and consolidate flows, disruptions at hubs could have large effects on the performance of a hub network. In this paper, we have formulated the multiple allocation p-hub median problem under intentional disruptions as a bi-level game model. In this model, the follower’s objective is to identify those hubs the loss of which would most diminish service efficiency. Moreover, the leader’s objective is to identify the set of hubs to locate in order to minimize expected transportation cost while taking normal and failure conditions into account. We have applied two algorithms based on simulated annealing to solve the defined problem. In addition, the algorithms have been calibrated using the Taguchi method. Computational experiments on different instances indicate that the proposed algorithms would be efficient in practice.


P-hub median problem Multiple allocation Disruption Bi-level programming Simulated annealing Taguchi method 


  1. Aksen D, Aras N (2012) A bilevel fixed charge location model for facilities under imminent attack. Comput Oper Res 39(7):1364–1381CrossRefGoogle Scholar
  2. Al-Aomar R (2006) Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs. Simul Model Pract Theory 14:201–223CrossRefGoogle Scholar
  3. Alumur SA, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190:1–21CrossRefGoogle Scholar
  4. Alumur SA, Nickel S, Saldanha-da-Gama F (2012) Hub location under uncertainty. Transp Res B 46:529–543CrossRefGoogle Scholar
  5. Beasley JE (1990) OR-Library: hub location. <>; Site last updated February 2008
  6. Ben-Ayed O, Boyce DE, Blair CE (1988) A general bilevel programming formulation of the network design problem. Transp Res B 22(4):311–318CrossRefGoogle Scholar
  7. Berman O, Drezner Z, Wesolowsky GO (2003) Locating service facilities whose reliability is distance dependent. Comput Oper Res 30(11):1683–1695CrossRefGoogle Scholar
  8. Berman O, Krass D, Menezes MBC (2007) Facility reliability issues in network p-median problems: strategic centralization and co-location effects. Oper Res 55(2):332–350CrossRefGoogle Scholar
  9. Berman O, Drezner T, Drezner Z, Wesolowsky GO (2009a) A defensive maximal covering problem on a network. Int Trans Oper Res 16:69–86CrossRefGoogle Scholar
  10. Berman O, Krass D, Menezes MBC (2009b) Locating facilities in the presence of disruptions and incomplete information. Decis Sci 40(4):845–868CrossRefGoogle Scholar
  11. Boland N, Krishnamoorthy M, Ernst AT, Ebery J (2004) Preprocessing and cutting for multiple allocation hub location problems. Eur J Oper Res 155(3):638–653CrossRefGoogle Scholar
  12. Camargo RS, Miranda G Jr, Luna HP (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput Oper Res 35(4):1047–1064CrossRefGoogle Scholar
  13. Campbell JF (1992) Location and allocation for distribution systems with transshipments and transportation economies of scale. Ann Oper Res 40:77–99CrossRefGoogle Scholar
  14. Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72:387–405CrossRefGoogle Scholar
  15. Campbell JF (1996) Hub location and the p-hub median problem. Oper Res 44(6):1–13Google Scholar
  16. Campbell JF (2009) Hub location for time definite transportation. Comput Oper Res 36:3107–3116CrossRefGoogle Scholar
  17. Cánovas L, García S, Marín A (2007) Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur J Oper Res 179:990–1007CrossRefGoogle Scholar
  18. Chen A, Yang C, Kongsomsaksakul S, Lee M (2007) Network-based accessibility measures for vulnerability analysis of degradable transportation networks. Netw Spat Econ 7(3):241–256CrossRefGoogle Scholar
  19. Cheng B-W, Chang C-L (2007) A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm. Expert Syst Appl 32:415–421CrossRefGoogle Scholar
  20. Church RL, Scaparra MP, Middleton RS (2004) Identifying critical infrastructure: the median and covering facility interdiction problems. Ann Assoc Am Geogr 94(3):491–502CrossRefGoogle Scholar
  21. Cui T, Ouyang Y, Shen ZJ (2010) Reliable facility location design under the risk of disruptions. Oper Res Part 1 58(4):998–1011CrossRefGoogle Scholar
  22. Drezner Z (1987) Heuristic solution methods for two location problems with unreliable facilities. J Oper Res Soc 38(6):509–514Google Scholar
  23. Elhedhli S, Hu FX (2005) Hub-and-spoke network design with congestion. Comput Oper Res 32:1615–1632CrossRefGoogle Scholar
  24. Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3):139–154CrossRefGoogle Scholar
  25. Ernst AT, Krishnamoorthy M (1998a) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur J Oper Res 104:100–112CrossRefGoogle Scholar
  26. Ernst AT, Krishnamoorthy M (1998b) An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J Comput 10(2):149–162CrossRefGoogle Scholar
  27. García S, Landete M, Marín A (2012) New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem. Eur J Oper Res 220:48–57CrossRefGoogle Scholar
  28. Gelareh S, Nickel S (2011) Hub location problems in transportation networks. Transp Res E 47:1092–1111CrossRefGoogle Scholar
  29. Hamacher HW, Labbé M, Nickel S, Sonneborn T (2004) Adapting polyhedral properties from facility to hub location Problems. Discret Appl Math 145(1):104–116CrossRefGoogle Scholar
  30. Hecheng L, Yuping W (2008) Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems. J Syst Eng Electron 19(6):1157–1164CrossRefGoogle Scholar
  31. Hedayat AS, Sloane NJA, Stufken J (1999) Orthogonal Arrays: Theory and Applications. Springer, New YorkCrossRefGoogle Scholar
  32. Hejazi SR, Memarian AL, Jahanshahloo G, Sepehri MM (2002) Linear bi-level programming solution by genetic algorithm. Comput Oper Res 29(13):1913–1925CrossRefGoogle Scholar
  33. Ishfaq R, Sox CR (2011) Hub location–allocation in intermodal logistic networks. Eur J Oper Res 210:213–230CrossRefGoogle Scholar
  34. Keçici S, Aras N, Verter V (2012) Incorporating the threat of terrorist attacks in the design of public service facility networks. Optim Lett 6(6):1101–1121CrossRefGoogle Scholar
  35. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680CrossRefGoogle Scholar
  36. Klincewicz JG (1996) A dual algorithm for the uncapacitated hub location problem. Locat Sci 4(3):173–184CrossRefGoogle Scholar
  37. Kuby MJ, Church R (2010) Introduction to the special issue on location modeling. Netw Spat Econ 10(3):293–295CrossRefGoogle Scholar
  38. Kuo RJ, Huang CC (2009) Application of particle swarm optimization algorithm for solving bi-level linear programming problem. Comput Math Appl 58:678–685CrossRefGoogle Scholar
  39. Lan KM, Wen UP, Shih HS, Lee ES (2007) A hybrid neural network approach to bilevel programming problems. Appl Math Lett 20:880–884CrossRefGoogle Scholar
  40. Lee SD (2001) On solving unreliable planar location problems. Comput Oper Res 28:329–344CrossRefGoogle Scholar
  41. Li X, Ouyang Y (2010) A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions. Transp Res B 44:535–548CrossRefGoogle Scholar
  42. Liberatore F, Scaparra MP (2011) Optimizing protection strategies for supply chains: comparing classic decision-making criteria in an uncertain environment. Ann Assoc Am Geogr 101(6):1241–1258CrossRefGoogle Scholar
  43. Liberatore F, Scaparra MP, Daskin MS (2011) Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification. Comput Oper Res 38:357–366CrossRefGoogle Scholar
  44. Liberatore F, Scaparra MP, Daskin MS (2012) Hedging against disruptions with ripple effects in location analysis. Omega 40:21–30CrossRefGoogle Scholar
  45. Lim M, Daskin MS, Bassamboo A, Chopra S (2010) A facility reliability problem: formulation, properties, and algorithm. Nav Res Logist 57(1):58–70Google Scholar
  46. Losada C, Scaparra MP, Church RL (2010) On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions. Electron Notes Discrete Math 36:591–598CrossRefGoogle Scholar
  47. Losada C, Scaparra MP, Church RL, Daskin MS (2012a) The stochastic interdiction median problem with disruption intensity levels. Ann Oper Res 201(1):345–365Google Scholar
  48. Losada C, Scaparra MP, O’Hanley JR (2012b) Optimizing system resilience: a facility protection model with recovery time. Eur J Oper Res 217(3):519–530CrossRefGoogle Scholar
  49. Lundy M, Mees A (1986) Convergence of an annealing algorithm. Math Program 34(1):111–124CrossRefGoogle Scholar
  50. Marín A (2005) Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm. J Glob Optim 33:393–422CrossRefGoogle Scholar
  51. Marín A, Cínovas L, Landete M (2006) New formulations for the uncapacitated multiple allocation hub location problem. Eur J Oper Res 172(1):274–292CrossRefGoogle Scholar
  52. Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level linear programming. Oper Res 28(1):1–21Google Scholar
  53. Matisziw TC, Murray AT, Grubesic TH (2010) Strategic network restoration. Netw Spat Econ 10(3):345–361CrossRefGoogle Scholar
  54. Mayer G, Wagner B (2002) Hublocater: an exact solution method for the multiple allocation hub location problem. Comput Oper Res 29(6):717–739CrossRefGoogle Scholar
  55. Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087–1092CrossRefGoogle Scholar
  56. Naderi B, Zandieh M, Khaleghi Ghoshe Balagh A, Roshanaei V (2009) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36:9625–9633CrossRefGoogle Scholar
  57. Naderi B, Fatemi Ghomi SMT, Aminnayeri M, Zandieh M (2011) Scheduling open shops with parallel machines to minimize total completion time. J Comput Appl Math 235:1275–1287CrossRefGoogle Scholar
  58. O’Hanley JR, Church RL (2011) Designing robust coverage networks to hedge against worst-case facility losses. Eur J Oper Res 209:23–36CrossRefGoogle Scholar
  59. O’Kelly M (2010) Routing traffic at hub facilities. Netw Spat Econ 10:173–191CrossRefGoogle Scholar
  60. Peng P, Snyder LV, Lim A, Liu Z (2011) Reliable logistics networks design with facility disruptions. Transp Res B 45:1190–1211CrossRefGoogle Scholar
  61. Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, New JerseyGoogle Scholar
  62. Ross PJ (1995) Taguchi Techniques for Quality Engineering, 2nd edn. McGraw-Hill, USAGoogle Scholar
  63. Rostamian Delavar M, Hajiaghaei-Keshteli M, Molla-Alizadeh-Zavardehi S (2010) Genetic algorithms for coordinated scheduling of production and air transportation. Expert Syst Appl 37:8255–8266CrossRefGoogle Scholar
  64. Roy RK (1990) A Primer on the Taguchi Method. Van Nostrand Reinhold, New YorkGoogle Scholar
  65. Saharidis GK, Ierapetritou MG (2008) Resolution method for mixed integer bi-level linear problems based on decomposition technique. J Glob Optim 44(1):29–51CrossRefGoogle Scholar
  66. Scaparra MP, Church RL (2008) A bilevel mixed-integer program for critical infrastructure protection planning. Comput Oper Res 35:1905–1923CrossRefGoogle Scholar
  67. 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:582–593CrossRefGoogle Scholar
  68. Snyder LV, Daskin MS (2005) Reliability models for facility location: the expected failure cost case. Transp Sci 39(3):400–416CrossRefGoogle Scholar
  69. Snyder LV, Scaparra MP, Daskin MS, Church RL (2006) Planning for disruptions in supply chain networks. Tutorials in Operations Research, INFORMS, pp. 234–257. doi: 10.1287/educ.1063.0025
  70. Sohn J, Park S (1998) Efficient solution procedure and reduced size formulations for p-hub location problems. Eur J Oper Res 108:118–126CrossRefGoogle Scholar
  71. Taguchi G (1986) Introduction to Quality Engineering: Designing Quality into Products and Processes. Asian Productivity Organization, TokyoGoogle Scholar
  72. Tsai JT, Ho WH, Liu TK, Chou JH (2007) Improved immune algorithm for global numerical optimization and job shop scheduling problems. Appl Math Comput 194(2):406–424CrossRefGoogle Scholar
  73. Wen UP, Huang AD (1996) A simple Tabu Search method to solve the mixed-integer problem bi-level programming problem. Eur J Oper Res 88(3):563–571CrossRefGoogle Scholar
  74. Yaman H (2011) Allocation strategies in hub networks. Eur J Oper Res 211:442–451CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • F. Parvaresh
    • 1
  • S. A. Hashemi Golpayegany
    • 2
  • S. M. Moattar Husseini
    • 1
  • B. Karimi
    • 1
  1. 1.Department of Industrial Engineering and Management SystemsAmirkabir University of TechnologyTehranIran
  2. 2.Department of Computer Engineering and Information TechnologyAmirkabir University of TechnologyTehranIran

Personalised recommendations