Skip to main content
SpringerLink
Log in

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

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Aksen D, Aras N (2012) A bilevel fixed charge location model for facilities under imminent attack. Comput Oper Res 39(7):1364–1381

    Article  Google Scholar 

  • Al-Aomar R (2006) Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs. Simul Model Pract Theory 14:201–223

    Article  Google Scholar 

  • Alumur SA, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190:1–21

    Article  Google Scholar 

  • Alumur SA, Nickel S, Saldanha-da-Gama F (2012) Hub location under uncertainty. Transp Res B 46:529–543

    Article  Google Scholar 

  • Beasley JE (1990) OR-Library: hub location. <http://people.brunel.ac.uk/~mastjjb/jeb/orlib/phubinfo.html>; Site last updated February 2008

  • Ben-Ayed O, Boyce DE, Blair CE (1988) A general bilevel programming formulation of the network design problem. Transp Res B 22(4):311–318

    Article  Google Scholar 

  • Berman O, Drezner Z, Wesolowsky GO (2003) Locating service facilities whose reliability is distance dependent. Comput Oper Res 30(11):1683–1695

    Article  Google Scholar 

  • 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–350

    Article  Google Scholar 

  • Berman O, Drezner T, Drezner Z, Wesolowsky GO (2009a) A defensive maximal covering problem on a network. Int Trans Oper Res 16:69–86

    Article  Google Scholar 

  • Berman O, Krass D, Menezes MBC (2009b) Locating facilities in the presence of disruptions and incomplete information. Decis Sci 40(4):845–868

    Article  Google Scholar 

  • 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–653

    Article  Google Scholar 

  • Camargo RS, Miranda G Jr, Luna HP (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput Oper Res 35(4):1047–1064

    Article  Google Scholar 

  • Campbell JF (1992) Location and allocation for distribution systems with transshipments and transportation economies of scale. Ann Oper Res 40:77–99

    Article  Google Scholar 

  • Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72:387–405

    Article  Google Scholar 

  • Campbell JF (1996) Hub location and the p-hub median problem. Oper Res 44(6):1–13

    Google Scholar 

  • Campbell JF (2009) Hub location for time definite transportation. Comput Oper Res 36:3107–3116

    Article  Google Scholar 

  • 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–1007

    Article  Google Scholar 

  • 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–256

    Article  Google Scholar 

  • 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–421

    Article  Google Scholar 

  • Church RL, Scaparra MP, Middleton RS (2004) Identifying critical infrastructure: the median and covering facility interdiction problems. Ann Assoc Am Geogr 94(3):491–502

    Article  Google Scholar 

  • Cui T, Ouyang Y, Shen ZJ (2010) Reliable facility location design under the risk of disruptions. Oper Res Part 1 58(4):998–1011

    Article  Google Scholar 

  • Drezner Z (1987) Heuristic solution methods for two location problems with unreliable facilities. J Oper Res Soc 38(6):509–514

    Google Scholar 

  • Elhedhli S, Hu FX (2005) Hub-and-spoke network design with congestion. Comput Oper Res 32:1615–1632

    Article  Google Scholar 

  • Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3):139–154

    Article  Google Scholar 

  • Ernst AT, Krishnamoorthy M (1998a) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur J Oper Res 104:100–112

    Article  Google Scholar 

  • Ernst AT, Krishnamoorthy M (1998b) An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J Comput 10(2):149–162

    Article  Google Scholar 

  • 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–57

    Article  Google Scholar 

  • Gelareh S, Nickel S (2011) Hub location problems in transportation networks. Transp Res E 47:1092–1111

    Article  Google Scholar 

  • Hamacher HW, Labbé M, Nickel S, Sonneborn T (2004) Adapting polyhedral properties from facility to hub location Problems. Discret Appl Math 145(1):104–116

    Article  Google Scholar 

  • Hecheng L, Yuping W (2008) Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems. J Syst Eng Electron 19(6):1157–1164

    Article  Google Scholar 

  • Hedayat AS, Sloane NJA, Stufken J (1999) Orthogonal Arrays: Theory and Applications. Springer, New York

    Book  Google Scholar 

  • Hejazi SR, Memarian AL, Jahanshahloo G, Sepehri MM (2002) Linear bi-level programming solution by genetic algorithm. Comput Oper Res 29(13):1913–1925

    Article  Google Scholar 

  • Ishfaq R, Sox CR (2011) Hub location–allocation in intermodal logistic networks. Eur J Oper Res 210:213–230

    Article  Google Scholar 

  • 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–1121

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  Google Scholar 

  • Klincewicz JG (1996) A dual algorithm for the uncapacitated hub location problem. Locat Sci 4(3):173–184

    Article  Google Scholar 

  • Kuby MJ, Church R (2010) Introduction to the special issue on location modeling. Netw Spat Econ 10(3):293–295

    Article  Google Scholar 

  • Kuo RJ, Huang CC (2009) Application of particle swarm optimization algorithm for solving bi-level linear programming problem. Comput Math Appl 58:678–685

    Article  Google Scholar 

  • Lan KM, Wen UP, Shih HS, Lee ES (2007) A hybrid neural network approach to bilevel programming problems. Appl Math Lett 20:880–884

    Article  Google Scholar 

  • Lee SD (2001) On solving unreliable planar location problems. Comput Oper Res 28:329–344

    Article  Google Scholar 

  • Li X, Ouyang Y (2010) A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions. Transp Res B 44:535–548

    Article  Google Scholar 

  • 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–1258

    Article  Google Scholar 

  • 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–366

    Article  Google Scholar 

  • Liberatore F, Scaparra MP, Daskin MS (2012) Hedging against disruptions with ripple effects in location analysis. Omega 40:21–30

    Article  Google Scholar 

  • Lim M, Daskin MS, Bassamboo A, Chopra S (2010) A facility reliability problem: formulation, properties, and algorithm. Nav Res Logist 57(1):58–70

    Google Scholar 

  • 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–598

    Article  Google Scholar 

  • Losada C, Scaparra MP, Church RL, Daskin MS (2012a) The stochastic interdiction median problem with disruption intensity levels. Ann Oper Res 201(1):345–365

    Google Scholar 

  • 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–530

    Article  Google Scholar 

  • Lundy M, Mees A (1986) Convergence of an annealing algorithm. Math Program 34(1):111–124

    Article  Google Scholar 

  • Marín A (2005) Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm. J Glob Optim 33:393–422

    Article  Google Scholar 

  • 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–292

    Article  Google Scholar 

  • Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level linear programming. Oper Res 28(1):1–21

    Google Scholar 

  • Matisziw TC, Murray AT, Grubesic TH (2010) Strategic network restoration. Netw Spat Econ 10(3):345–361

    Article  Google Scholar 

  • Mayer G, Wagner B (2002) Hublocater: an exact solution method for the multiple allocation hub location problem. Comput Oper Res 29(6):717–739

    Article  Google Scholar 

  • 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–1092

    Article  Google Scholar 

  • 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–9633

    Article  Google Scholar 

  • 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–1287

    Article  Google Scholar 

  • O’Hanley JR, Church RL (2011) Designing robust coverage networks to hedge against worst-case facility losses. Eur J Oper Res 209:23–36

    Article  Google Scholar 

  • O’Kelly M (2010) Routing traffic at hub facilities. Netw Spat Econ 10:173–191

    Article  Google Scholar 

  • Peng P, Snyder LV, Lim A, Liu Z (2011) Reliable logistics networks design with facility disruptions. Transp Res B 45:1190–1211

    Article  Google Scholar 

  • Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, New Jersey

  • Ross PJ (1995) Taguchi Techniques for Quality Engineering, 2nd edn. McGraw-Hill, USA

    Google Scholar 

  • 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–8266

    Article  Google Scholar 

  • Roy RK (1990) A Primer on the Taguchi Method. Van Nostrand Reinhold, New York

    Google Scholar 

  • Saharidis GK, Ierapetritou MG (2008) Resolution method for mixed integer bi-level linear problems based on decomposition technique. J Glob Optim 44(1):29–51

    Article  Google Scholar 

  • Scaparra MP, Church RL (2008) A bilevel mixed-integer program for critical infrastructure protection planning. Comput Oper Res 35:1905–1923

    Article  Google Scholar 

  • 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–593

    Article  Google Scholar 

  • Snyder LV, Daskin MS (2005) Reliability models for facility location: the expected failure cost case. Transp Sci 39(3):400–416

    Article  Google Scholar 

  • 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

  • Sohn J, Park S (1998) Efficient solution procedure and reduced size formulations for p-hub location problems. Eur J Oper Res 108:118–126

    Article  Google Scholar 

  • Taguchi G (1986) Introduction to Quality Engineering: Designing Quality into Products and Processes. Asian Productivity Organization, Tokyo

    Google Scholar 

  • 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–424

    Article  Google Scholar 

  • 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–571

    Article  Google Scholar 

  • Yaman H (2011) Allocation strategies in hub networks. Eur J Oper Res 211:442–451

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran

    F. Parvaresh, S. M. Moattar Husseini & B. Karimi

  2. Department of Computer Engineering and Information Technology, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran

    S. A. Hashemi Golpayegany

Authors
  1. F. Parvaresh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. A. Hashemi Golpayegany
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. M. Moattar Husseini
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. B. Karimi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. M. Moattar Husseini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Parvaresh, F., Hashemi Golpayegany, S.A., Moattar Husseini, S.M. et al. Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing. Netw Spat Econ 13, 445–470 (2013). https://doi.org/10.1007/s11067-013-9189-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-013-9189-3

Keywords

Search

Navigation