메뉴 건너뛰기




Volumn 46, Issue 4, 2012, Pages 529-543

Hub location under uncertainty

Author keywords

Hub location; Robust optimization; Stochastic demands; Uncertainty

Indexed keywords

DECISION MAKING; LOCATION; OPTIMIZATION; STOCHASTIC SYSTEMS;

EID: 84857684002     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2011.11.006     Document Type: Article
Times cited : (174)

References (48)
  • 1
    • 0032050759 scopus 로고    scopus 로고
    • A hybrid heuristic for the uncapacitated hub location problem
    • Abdinnour-Helm S. A hybrid heuristic for the uncapacitated hub location problem. European Journal of Operational Research 1998, 106(2):489-499.
    • (1998) European Journal of Operational Research , vol.106 , Issue.2 , pp. 489-499
    • Abdinnour-Helm, S.1
  • 3
    • 69549121712 scopus 로고    scopus 로고
    • A hub covering network design problem for cargo applications in Turkey
    • Alumur S., Kara B.Y. A hub covering network design problem for cargo applications in Turkey. Journal of the Operational Research Society 2009, 60(10):1349-1359.
    • (2009) Journal of the Operational Research Society , vol.60 , Issue.10 , pp. 1349-1359
    • Alumur, S.1    Kara, B.Y.2
  • 5
    • 0028681894 scopus 로고
    • Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
    • Aykin T. Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. European Journal of Operational Research 1994, 79(3):501-523.
    • (1994) European Journal of Operational Research , vol.79 , Issue.3 , pp. 501-523
    • Aykin, T.1
  • 8
    • 67349254528 scopus 로고    scopus 로고
    • A tabu-based heuristic for the hub covering problem over incomplete hub networks
    • Calik H., Alumur S.A., Kara B.Y., Karasan O.E. A tabu-based heuristic for the hub covering problem over incomplete hub networks. Computers & Operations Research 2009, 36(12):3088-3096.
    • (2009) Computers & Operations Research , vol.36 , Issue.12 , pp. 3088-3096
    • Calik, H.1    Alumur, S.A.2    Kara, B.Y.3    Karasan, O.E.4
  • 9
    • 0028259333 scopus 로고
    • Integer programming formulations of discrete hub location problems
    • Campbell J.F. Integer programming formulations of discrete hub location problems. European Journal of Operational Research 1994, 72(2):387-405.
    • (1994) European Journal of Operational Research , vol.72 , Issue.2 , pp. 387-405
    • Campbell, J.F.1
  • 10
    • 0030282403 scopus 로고    scopus 로고
    • Hub location and the p-hub median problem
    • Campbell J.F. Hub location and the p-hub median problem. Operations Research 1996, 44(6):1-13.
    • (1996) Operations Research , vol.44 , Issue.6 , pp. 1-13
    • Campbell, J.F.1
  • 11
    • 27544484180 scopus 로고    scopus 로고
    • Hub arc location problems: Part I - introduction and results
    • Campbell J.F., Ernst A.T., Krishnamoorthy M. Hub arc location problems: Part I - introduction and results. Management Science 2005, 51(10):1540-1555.
    • (2005) Management Science , vol.51 , Issue.10 , pp. 1540-1555
    • Campbell, J.F.1    Ernst, A.T.2    Krishnamoorthy, M.3
  • 12
    • 27544495247 scopus 로고    scopus 로고
    • Hub arc location problems: Part II - formulations and optimal algorithms
    • Campbell J.F., Ernst A.T., Krishnamoorthy M. Hub arc location problems: Part II - formulations and optimal algorithms. Management Science 2005, 51(10):1556-1571.
    • (2005) Management Science , vol.51 , Issue.10 , pp. 1556-1571
    • Campbell, J.F.1    Ernst, A.T.2    Krishnamoorthy, M.3
  • 13
    • 85029834232 scopus 로고    scopus 로고
    • Exact solution of large-scale hub location problems with multiple capacity levels
    • in press
    • Contreras, I., Cordeau, J.-F., Laporte, G., in press. Exact solution of large-scale hub location problems with multiple capacity levels. Transportation Science.
    • Transportation Science.
    • Contreras, I.1    Cordeau, J.-F.2    Laporte, G.3
  • 14
    • 67349162967 scopus 로고    scopus 로고
    • Tight bounds from a path based formulation for the tree of hub location problem
    • Contreras I., Fernández E., Marín A. Tight bounds from a path based formulation for the tree of hub location problem. Computers & Operations Research 2009, 36(12):3117-3127.
    • (2009) Computers & Operations Research , vol.36 , Issue.12 , pp. 3117-3127
    • Contreras, I.1    Fernández, E.2    Marín, A.3
  • 17
    • 84855297105 scopus 로고    scopus 로고
    • Benders decomposition for large-scale uncapacitated hub location
    • doi:10.1287/opre.1110.0965
    • Contreras, I., Cordeau, J.-F., Laporte, G., 2012. Benders decomposition for large-scale uncapacitated hub location. Operations Research. doi:10.1287/opre.1110.0965.
    • (2012) Operations Research.
    • Contreras, I.1    Cordeau, J.-F.2    Laporte, G.3
  • 18
    • 77953873296 scopus 로고    scopus 로고
    • The capacitated single-allocation hub location problem revisited: a note on a classical formulation
    • Correia I., Nickel S., da Gama F.S. The capacitated single-allocation hub location problem revisited: a note on a classical formulation. European Journal of Operational Research 2010, 207(1):92-96.
    • (2010) European Journal of Operational Research , vol.207 , Issue.1 , pp. 92-96
    • Correia, I.1    Nickel, S.2    da Gama, F.S.3
  • 19
    • 41349092784 scopus 로고    scopus 로고
    • Capacitated single allocation hub location problem - a bi-criteria approach
    • Costa M., Captivo M., Clímaco J. Capacitated single allocation hub location problem - a bi-criteria approach. Computers & Operations Research 2008, 35(11):3671-3695.
    • (2008) Computers & Operations Research , vol.35 , Issue.11 , pp. 3671-3695
    • Costa, M.1    Captivo, M.2    Clímaco, J.3
  • 21
    • 0040913897 scopus 로고    scopus 로고
    • Efficient algorithms for the uncapacitated single allocation p-hub median problem
    • Ernst A.T., Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science 1996, 4(3):139-154.
    • (1996) Location Science , vol.4 , Issue.3 , pp. 139-154
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 22
    • 0031647407 scopus 로고    scopus 로고
    • Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
    • Ernst A.T., Krishnamoorthy M. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research 1998, 104(1):100-112.
    • (1998) European Journal of Operational Research , vol.104 , Issue.1 , pp. 100-112
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 23
    • 0005036454 scopus 로고    scopus 로고
    • An exact solution approach based on shortest-paths for p-hub median problems
    • Ernst A.T., Krishnamoorthy M. An exact solution approach based on shortest-paths for p-hub median problems. Informs Journal on Computing 1998, 10(2):149-162.
    • (1998) Informs Journal on Computing , vol.10 , Issue.2 , pp. 149-162
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 24
    • 0043096486 scopus 로고    scopus 로고
    • Solution algorithms for the capacitated single allocation hub location problem
    • Ernst A.T., Krishnamoorthy M. Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research 1999, 86(0):141-159.
    • (1999) Annals of Operations Research , vol.86 , Issue.0 , pp. 141-159
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 25
    • 4944226646 scopus 로고    scopus 로고
    • Adapting polyhedral properties from facility to hub location problems
    • Hamacher H., Labbé M., Nickel S., Sonneborn T. Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics 2004, 145(1):104-116.
    • (2004) Discrete Applied Mathematics , vol.145 , Issue.1 , pp. 104-116
    • Hamacher, H.1    Labbé, M.2    Nickel, S.3    Sonneborn, T.4
  • 26
    • 0036013019 scopus 로고    scopus 로고
    • The sample average approximation method for stochastic discrete optimization
    • Kleywegt A.J., Shapiro A., de Mello T.H. The sample average approximation method for stochastic discrete optimization. SIAM Journal of Optimization 2001, 12(2):479-502.
    • (2001) SIAM Journal of Optimization , vol.12 , Issue.2 , pp. 479-502
    • Kleywegt, A.J.1    Shapiro, A.2    de Mello, T.H.3
  • 28
    • 4444277652 scopus 로고    scopus 로고
    • Projecting flow variables for hub location problems
    • Labbé M., Yaman H. Projecting flow variables for hub location problems. Networks 2004, 44(2):84-93.
    • (2004) Networks , vol.44 , Issue.2 , pp. 84-93
    • Labbé, M.1    Yaman, H.2
  • 29
    • 21144447914 scopus 로고    scopus 로고
    • A branch and cut algorithm for the hub location problems with single assignment
    • Labbé M., Yaman H., Gourdin E. A branch and cut algorithm for the hub location problems with single assignment. Mathematical Programming 2005, 102(2):371-405.
    • (2005) Mathematical Programming , vol.102 , Issue.2 , pp. 371-405
    • Labbé, M.1    Yaman, H.2    Gourdin, E.3
  • 30
    • 70449659516 scopus 로고    scopus 로고
    • A study of demand stochasticity in service network design
    • Lium A.-G., Crainic T.G., Wallace S.W. A study of demand stochasticity in service network design. Transportation Science 2009, 43(2):144-157.
    • (2009) Transportation Science , vol.43 , Issue.2 , pp. 144-157
    • Lium, A.-G.1    Crainic, T.G.2    Wallace, S.W.3
  • 31
    • 0037410805 scopus 로고    scopus 로고
    • Location models for airline hubs behaving as M/D/c queues
    • Marianov V., Serra D. Location models for airline hubs behaving as M/D/c queues. Computers & Operations Research 2003, 30(7):983-1003.
    • (2003) Computers & Operations Research , vol.30 , Issue.7 , pp. 983-1003
    • Marianov, V.1    Serra, D.2
  • 32
    • 19944364954 scopus 로고    scopus 로고
    • Formulating and solving splittable capacitated multiple allocation hub location problems
    • Marin A. Formulating and solving splittable capacitated multiple allocation hub location problems. Computers & Operations Research 2005, 32(12):3093-3109.
    • (2005) Computers & Operations Research , vol.32 , Issue.12 , pp. 3093-3109
    • Marin, A.1
  • 33
    • 0036567974 scopus 로고    scopus 로고
    • Hublocator: an exact solution method for the multiple allocation hub location problem
    • Mayer G., Wagner B. Hublocator: an exact solution method for the multiple allocation hub location problem. Computers & Operations Research 2002, 29(6):715-739.
    • (2002) Computers & Operations Research , vol.29 , Issue.6 , pp. 715-739
    • Mayer, G.1    Wagner, B.2
  • 35
    • 0022908535 scopus 로고
    • Activity levels at hub facilities in interacting networks
    • O'Kelly M. Activity levels at hub facilities in interacting networks. Geographical Analysis 1986, 18(4):343-356.
    • (1986) Geographical Analysis , vol.18 , Issue.4 , pp. 343-356
    • O'Kelly, M.1
  • 36
    • 0023561366 scopus 로고
    • A quadratic integer problem for the location of interacting hub facilities
    • O'Kelly M. A quadratic integer problem for the location of interacting hub facilities. European Journal of Operational Research 1987, 32(3):393-404.
    • (1987) European Journal of Operational Research , vol.32 , Issue.3 , pp. 393-404
    • O'Kelly, M.1
  • 37
    • 84881016647 scopus 로고    scopus 로고
    • Hub network design with single and multiple allocation: a computational study
    • O'Kelly M., Bryan D., Skorin-Kapov D., Skorin-Kapov J. Hub network design with single and multiple allocation: a computational study. Location Science 1996, 4(3):125-138.
    • (1996) Location Science , vol.4 , Issue.3 , pp. 125-138
    • O'Kelly, M.1    Bryan, D.2    Skorin-Kapov, D.3    Skorin-Kapov, J.4
  • 38
    • 85029881716 scopus 로고    scopus 로고
    • OR-Library
    • OR-Library, 2011. http://people.brunel.ac.uk/~mastjjb/jeb/info.html.
    • (2011)
  • 39
    • 0032298440 scopus 로고    scopus 로고
    • An efficient procedure for designing single allocation hub and spoke systems
    • Pirkul H., Schilling D. An efficient procedure for designing single allocation hub and spoke systems. Management Science 1998, 44(12):235-242.
    • (1998) Management Science , vol.44 , Issue.12 , pp. 235-242
    • Pirkul, H.1    Schilling, D.2
  • 41
    • 67349138178 scopus 로고    scopus 로고
    • The stochastic p-hub center problem with service-level constraints
    • Sim T., Lowe T.J., Thomas B.W. The stochastic p-hub center problem with service-level constraints. Computers & Operations Research 2009, 36(12):3166-3177.
    • (2009) Computers & Operations Research , vol.36 , Issue.12 , pp. 3166-3177
    • Sim, T.1    Lowe, T.J.2    Thomas, B.W.3
  • 44
    • 33646348751 scopus 로고    scopus 로고
    • Facility location under uncertainty: a review
    • Snyder L. Facility location under uncertainty: a review. IIE Transactions 2006, 38(7):537-554.
    • (2006) IIE Transactions , vol.38 , Issue.7 , pp. 537-554
    • Snyder, L.1
  • 45
    • 38749085708 scopus 로고    scopus 로고
    • Star p-hub median problem with modular arc capacities
    • Yaman H. Star p-hub median problem with modular arc capacities. Computers & Operations Research 2008, 35(9):3009-3019.
    • (2008) Computers & Operations Research , vol.35 , Issue.9 , pp. 3009-3019
    • Yaman, H.1
  • 46
    • 79952191406 scopus 로고    scopus 로고
    • Allocation strategies in hub networks
    • Yaman H. Allocation strategies in hub networks. European Journal of Operational Research 2011, 211(3):442-451.
    • (2011) European Journal of Operational Research , vol.211 , Issue.3 , pp. 442-451
    • Yaman, H.1
  • 47
    • 68049129689 scopus 로고    scopus 로고
    • Stochastic air freight hub location and flight routes planning
    • Yang T.-H. Stochastic air freight hub location and flight routes planning. Applied Mathematical Modelling 2009, 33(12):4424-4430.
    • (2009) Applied Mathematical Modelling , vol.33 , Issue.12 , pp. 4424-4430
    • Yang, T.-H.1
  • 48
    • 37149030076 scopus 로고    scopus 로고
    • The hub location and network design problem with fixed and variable arc costs
    • Yoon M., Current J. The hub location and network design problem with fixed and variable arc costs. Journal of the Operational Research Society 2008, 59(1):80-89.
    • (2008) Journal of the Operational Research Society , vol.59 , Issue.1 , pp. 80-89
    • Yoon, M.1    Current, J.2


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