메뉴 건너뛰기




Volumn 228, Issue 4, 2014, Pages 337-346

Developing prevention reliability in hub location models

Author keywords

Hub location problems; logistics; network reliability; reliability engineering; security analysis

Indexed keywords

AIR TRANSPORTATION; INTEGER PROGRAMMING; LOGISTICS; RELIABILITY;

EID: 84904554595     PISSN: 1748006X     EISSN: 17480078     Source Type: Journal    
DOI: 10.1177/1748006X13519247     Document Type: Article
Times cited : (10)

References (35)
  • 1
    • 41149134458 scopus 로고    scopus 로고
    • Network hub location problems: The state of the art
    • DOI 10.1016/j.ejor.2007.06.008, PII S0377221707005577
    • Alumur S, Kara BY. Network hub location problems: the state of the art. Eur J Oper Res. 2008 ; 190 (1). 1-21 (Pubitemid 351434635)
    • (2008) European Journal of Operational Research , vol.190 , Issue.1 , pp. 1-21
    • Alumur, S.1    Kara, B.Y.2
  • 2
    • 84861801133 scopus 로고    scopus 로고
    • Twenty-five years of hub location research
    • Campbell JF, O'Kelly ME. Twenty-five years of hub location research. Transport Sci. 2012 ; 48 (2). 153-169
    • (2012) Transport Sci , vol.48 , Issue.2 , pp. 153-169
    • Campbell, J.F.1    O'Kelly, M.E.2
  • 3
    • 84875952344 scopus 로고    scopus 로고
    • Hub location problems: A review of models, classification, solution techniques, and applications
    • Farahani RZ, Hekmatfar M, Arabani AB, et al. Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng. 2013 ; 64 (4). 1096-1109
    • (2013) Comput Ind Eng , vol.64 , Issue.4 , pp. 1096-1109
    • Farahani, R.Z.1    Hekmatfar, M.2    Arabani, A.B.3
  • 4
    • 0023561366 scopus 로고
    • A quadratic integer program for the location of interacting hub facilities
    • O'Kelly ME. A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res. 1987 ; 32 (3). 393-404
    • (1987) Eur J Oper Res , vol.32 , Issue.3 , pp. 393-404
    • O'Kelly, M.E.1
  • 5
    • 0028259333 scopus 로고
    • Integer programming formulations of discrete hub location problems
    • Campbell JF. Integer programming formulations of discrete hub location problems. Eur J Oper Res. 1994 ; 72 (2). 387-405
    • (1994) Eur J Oper Res , vol.72 , Issue.2 , pp. 387-405
    • Campbell, J.F.1
  • 6
    • 0040913897 scopus 로고    scopus 로고
    • Efficient algorithms for the uncapacitated single allocation p-hub median problem
    • Ernst AT, Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci. 1996 ; 4 (3). 139-154
    • (1996) Locat Sci , vol.4 , Issue.3 , pp. 139-154
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 7
    • 34147154835 scopus 로고    scopus 로고
    • Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem
    • DOI 10.1016/j.ejor.2006.06.056, PII S0377221706006163
    • Kratica J, Stanimirović Z, Tošić D, et al. Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res. 2007 ; 182 (1). 15-28 (Pubitemid 46562550)
    • (2007) European Journal of Operational Research , vol.182 , Issue.1 , pp. 15-28
    • Kratica, J.1    Stanimirovic, Z.2    Tosic, D.3    Filipovic, V.4
  • 8
    • 67349126984 scopus 로고    scopus 로고
    • The hierarchical hub median problem with single assignment
    • Yaman H. The hierarchical hub median problem with single assignment. Transport Res B: Meth. 2009 ; 43 (6). 643-658
    • (2009) Transport Res B: Meth , vol.43 , Issue.6 , pp. 643-658
    • Yaman, H.1
  • 9
    • 77956411123 scopus 로고    scopus 로고
    • Single-allocation ordered median hub location problems
    • Puerto J, Ramos AB, Rodríguez-Chía AM. Single-allocation ordered median hub location problems. Comput Oper Res. 2011 ; 38 (2). 559-570
    • (2011) Comput Oper Res , vol.38 , Issue.2 , pp. 559-570
    • Puerto, J.1    Ramos, A.B.2    Rodríguez-Chía, A.M.3
  • 10
    • 84857030832 scopus 로고    scopus 로고
    • The capacitated p-hub median problem with integral constraints: An application to a Chinese air cargo network
    • Lin C-C, Lin J-Y, Chen Y-C. The capacitated p-hub median problem with integral constraints: an application to a Chinese air cargo network. Appl Math Model. 2012 ; 36 (6). 2777-2787
    • (2012) Appl Math Model , vol.36 , Issue.6 , pp. 2777-2787
    • Lin, C.-C.1    Lin, J.-Y.2    Chen, Y.-C.3
  • 11
    • 0030282403 scopus 로고    scopus 로고
    • Hub location and the p-hub median problem
    • Campbell JF. Hub location and the p-hub median problem. Oper Res. 1996 ; 44 (6). 923-935 (Pubitemid 126669566)
    • (1996) Operations Research , vol.44 , Issue.6 , pp. 923-935
    • Campbell, J.F.1
  • 12
    • 77950459586 scopus 로고    scopus 로고
    • A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem
    • Ilić A, Uroševićb D, Brimberg J, et al. A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res. 2010 ; 206 (2). 289-300
    • (2010) Eur J Oper Res , vol.206 , Issue.2 , pp. 289-300
    • Ilić, A.1    Uroševićb, D.2    Brimberg, J.3
  • 13
    • 80255123291 scopus 로고    scopus 로고
    • Single allocation hub location problem under congestion: Network owner and user perspectives
    • De Camargo RS, Miranda G. Single allocation hub location problem under congestion: network owner and user perspectives. Expert Syst Appl. 2012 ; 39 (3). 3385-3391
    • (2012) Expert Syst Appl , vol.39 , Issue.3 , pp. 3385-3391
    • De Camargo, R.S.1    Miranda, G.2
  • 14
    • 0034273546 scopus 로고    scopus 로고
    • On the single-assignment p-hub center problem
    • Kara BY, Tansel ÇB. On the single-assignment p-hub center problem. Eur J Oper Res. 2000 ; 125 (3). 648-655
    • (2000) Eur J Oper Res , vol.125 , Issue.3 , pp. 648-655
    • Kara, B.Y.1    Tansel, Ç.B.2
  • 16
    • 67349197633 scopus 로고    scopus 로고
    • A 2-phase algorithm for solving the single allocation p-hub center problem
    • Meyer T, Ernst AT, Krishnamoorthy M. A 2-phase algorithm for solving the single allocation p-hub center problem. Comput Oper Res. 2009 ; 36 (12). 3143-3151
    • (2009) Comput Oper Res , vol.36 , Issue.12 , pp. 3143-3151
    • Meyer, T.1    Ernst, A.T.2    Krishnamoorthy, M.3
  • 17
    • 84859713541 scopus 로고    scopus 로고
    • Star p-hub center problem and star p-hub median problem with bounded path lengths
    • Yaman H, Elloumi S. Star p-hub center problem and star p-hub median problem with bounded path lengths. Comput Oper Res. 2012 ; 39 (11). 2725-2732
    • (2012) Comput Oper Res , vol.39 , Issue.11 , pp. 2725-2732
    • Yaman, H.1    Elloumi, S.2
  • 18
    • 84872490542 scopus 로고    scopus 로고
    • Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
    • Bashiri M, Mirzaei M, Randall M. Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution. Appl Math Model. 2013 ; 37 (5). 3513-3525
    • (2013) Appl Math Model , vol.37 , Issue.5 , pp. 3513-3525
    • Bashiri, M.1    Mirzaei, M.2    Randall, M.3
  • 19
    • 57849094927 scopus 로고    scopus 로고
    • Uncapacitated single and multiple allocation p-hub center problems
    • Ernst AT, Hamacher H, Jiang H, et al. Uncapacitated single and multiple allocation p-hub center problems. Comput Oper Res. 2009 ; 36 (7). 2230-2241
    • (2009) Comput Oper Res , vol.36 , Issue.7 , pp. 2230-2241
    • Ernst, A.T.1    Hamacher, H.2    Jiang, H.3
  • 20
    • 67349138178 scopus 로고    scopus 로고
    • The stochastic p-hub center problem with service-level constraints
    • Sim T, Lowe TJ, Thomas BW. The stochastic p-hub center problem with service-level constraints. Comput Oper Res. 2009 ; 36 (12). 3166-3177
    • (2009) Comput Oper Res , vol.36 , Issue.12 , pp. 3166-3177
    • Sim, T.1    Lowe, T.J.2    Thomas, B.W.3
  • 21
    • 84855885952 scopus 로고    scopus 로고
    • Hub covering location problems with different coverage types
    • Karimi H, Bashiri M. Hub covering location problems with different coverage types. Sci Iran. 2011 ; 18 (6). 1571-1578
    • (2011) Sci Iran , vol.18 , Issue.6 , pp. 1571-1578
    • Karimi, H.1    Bashiri, M.2
  • 22
    • 67349213348 scopus 로고    scopus 로고
    • Path relinking approach for multiple allocation hub maximal covering problem
    • Qu B, Weng K. Path relinking approach for multiple allocation hub maximal covering problem. Comput Math Appl. 2009 ; 57 (11-12). 1890-1894
    • (2009) Comput Math Appl , vol.57 , Issue.1112 , pp. 1890-1894
    • Qu, B.1    Weng, K.2
  • 23
    • 67349254528 scopus 로고    scopus 로고
    • A tabu-search based heuristic for the hub covering problem over incomplete hub networks
    • Calik H, Alumur SA, Kara BY, et al. A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput Oper Res. 2009 ; 36 (12). 3088-3096
    • (2009) Comput Oper Res , vol.36 , Issue.12 , pp. 3088-3096
    • Calik, H.1    Alumur, S.A.2    Kara, B.Y.3
  • 24
    • 84860998123 scopus 로고    scopus 로고
    • Uncapacitated single allocation p-hub maximal covering problem
    • Hwang YH, Lee YH. Uncapacitated single allocation p-hub maximal covering problem. Comput Ind Eng. 2012 ; 63 (2). 382-389
    • (2012) Comput Ind Eng , vol.63 , Issue.2 , pp. 382-389
    • Hwang, Y.H.1    Lee, Y.H.2
  • 25
    • 69549121712 scopus 로고    scopus 로고
    • A hub covering network design problem for cargo applications in Turkey
    • Alumur S, Kara BY. A hub covering network design problem for cargo applications in Turkey. J Oper Res Soc. 2009 ; 60: 1349-1359
    • (2009) J Oper Res Soc , vol.60 , pp. 1349-1359
    • Alumur, S.1    Kara, B.Y.2
  • 26
    • 84866922501 scopus 로고    scopus 로고
    • P-hub protection models for survivable hub network design
    • Kim H. P-hub protection models for survivable hub network design. J Geogr Syst. 2012 ; 14 (4). 437-461
    • (2012) J Geogr Syst , vol.14 , Issue.4 , pp. 437-461
    • Kim, H.1
  • 27
    • 67650483306 scopus 로고    scopus 로고
    • Reliable p-hub location problems in telecommunication networks
    • Kim H, O'Kelly ME. Reliable p-hub location problems in telecommunication networks. Geogr Anal. 2009 ; 41 (3). 283-306
    • (2009) Geogr Anal , vol.41 , Issue.3 , pp. 283-306
    • Kim, H.1    O'Kelly, M.E.2
  • 31
    • 84873545679 scopus 로고    scopus 로고
    • Automatic honeypot generation and network deception
    • HudakS. Automatic honeypot generation and network deception. Scientific Literature Digital Library and Search, 2008., http://citeseerx.ist.psu.edu/ viewdoc/download?doi=10.1.1.111.8437&rep=rep1&type=pdf
    • (2008) Scientific Literature Digital Library and Search
    • Hudak, S.1
  • 32
    • 84876077867 scopus 로고    scopus 로고
    • Identifying critical facilities in hub-and-spoke networks: A hub interdiction median problem
    • Lei TL. Identifying critical facilities in hub-and-spoke networks: a hub interdiction median problem. Geogr Anal. 2013 ; 45 (2). 105-122
    • (2013) Geogr Anal , vol.45 , Issue.2 , pp. 105-122
    • Lei, T.L.1
  • 33
    • 69749127935 scopus 로고    scopus 로고
    • The design of single allocation incomplete hub networks
    • Alumur SA, Kara BY, Karasan OE. The design of single allocation incomplete hub networks. Transport Res B: Meth. 2009 ; 43 (10). 936-951
    • (2009) Transport Res B: Meth , vol.43 , Issue.10 , pp. 936-951
    • Alumur, S.A.1    Kara, B.Y.2    Karasan, O.E.3
  • 34
    • 78649782348 scopus 로고    scopus 로고
    • Hubbing and routing in postal delivery systems
    • Çetiner S, Sepil C, Süral H. Hubbing and routing in postal delivery systems. Ann Oper Res. 2010 ; 181 (1). 109-124
    • (2010) Ann Oper Res , vol.181 , Issue.1 , pp. 109-124
    • Çetiner, S.1    Sepil, C.2    Süral, H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.