메뉴 건너뛰기




Volumn 43, Issue 1, 2009, Pages 86-97

Benders decomposition for hub location problems with economies of scale

Author keywords

Benders decomposition; Hub and spoke networks; Scale economies

Indexed keywords

STOCHASTIC PROGRAMMING;

EID: 70450031013     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1080.0233     Document Type: Article
Times cited : (79)

References (40)
  • 1
    • 0028681894 scopus 로고
    • Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
    • Aykin, T. 1994. Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur. J. Oper. Res. 79 501-523.
    • (1994) Eur. J. Oper. Res. , vol.79 , pp. 501-523
    • Aykin, T.1
  • 2
    • 0029352467 scopus 로고
    • Network policies for hub-and-spoke systems with applications to the air transportation system
    • Aykin, T. 1995. Network policies for hub-and-spoke systems with applications to the air transportation system. Transportation Sci. 29(3) 201-221.
    • (1995) Transportation Sci. , vol.29 , Issue.3 , pp. 201-221
    • Aykin, T.1
  • 3
    • 9644308639 scopus 로고
    • Partitioning procedures for solving mixedvariables programming problems
    • Benders, J. F. 1962. Partitioning procedures for solving mixedvariables programming problems. Numerisch Mathematik 4 238-252.
    • (1962) Numerisch Mathematik , vol.4 , pp. 238-252
    • Benders, J.F.1
  • 4
    • 0023981220 scopus 로고
    • A multicut algorithm for two-stage stochastic linear programs
    • Birge, J. R., F. V. Louveaux. 1988. A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34 384-392.
    • (1988) Eur. J. Oper. Res. , vol.34 , pp. 384-392
    • Birge, J.R.1    Louveaux, F.V.2
  • 5
    • 0742301554 scopus 로고    scopus 로고
    • Preprocessing and cutting for multiple allocation hub location problem
    • Boland, N., M. Krishnamoorthy A. Ernst, J. Ebery 2004. Preprocessing and cutting for multiple allocation hub location problem. Eur. J. Oper. Res. 155 638-653.
    • (2004) Eur. J. Oper. Res. , vol.155 , pp. 638-653
    • Boland, N.1    Krishnamoorthy, M.2    Ernst, A.3    Ebery, J.4
  • 6
    • 0035268156 scopus 로고    scopus 로고
    • Solving large nonconvex water resources management models using generalized benders decomposition
    • Cai, X., D. C. McKinney L. S. Lasdon, D. W. Watkins, Jr. 2001. Solving large nonconvex water resources management models using generalized Benders decompositon. Oper. Res. 49(2) 235-245. (Pubitemid 32508829)
    • (2001) Operations Research , vol.49 , Issue.2 , pp. 235-245
    • Cai, X.1    McKinney, D.C.2    Lasdon, L.S.3    Watkins Jr., D.W.4
  • 7
    • 35248898324 scopus 로고    scopus 로고
    • Benders decomposition for the uncapacitated multiple allocation hub location problem
    • Camargo, R. S. d., G. d. Miranda, Jr., H. P. Luna. 2008. Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. 35(4) 1047-1064.
    • (2008) Comput. Oper. Res. , vol.35 , Issue.4 , pp. 1047-1064
    • Camargo, R.S.D.1    Miranda Jr., G.D.2    Luna, H.P.3
  • 8
    • 0028259333 scopus 로고
    • Integer programming formulations of discrete hub location problems
    • Campbell, J. F. 1994a. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72 387-405.
    • (1994) Eur. J. Oper. Res. , vol.72 , pp. 387-405
    • Campbell, J.F.1
  • 9
    • 0001770319 scopus 로고
    • A survey of network hub location
    • Campbell, J. F. 1994b. A survey of network hub location. Stud. Locational Anal. 6 31-49.
    • (1994) Stud. Locational Anal. , vol.6 , pp. 31-49
    • Campbell, J.F.1
  • 10
    • 0030282403 scopus 로고    scopus 로고
    • Hub location and the p-hub median problem
    • Campbell, J. F. 1996. Hub location and the p-hub median problem. OPRE 44(6) 923-935.
    • (1996) OPRE , vol.44 , Issue.6 , pp. 923-935
    • Campbell, J.F.1
  • 12
    • 0034187909 scopus 로고    scopus 로고
    • A Benders decomposition approach for the locomotive and car assignment problem
    • Cordeau, J. F., F. Soumis, J. Desrosiers. 2000. A Benders decomposition approach for the locomotive and car assignment problem. Transportation Sci. 34(2) 133-149.
    • (2000) Transportation Sci. , vol.34 , Issue.2 , pp. 133-149
    • Cordeau, J.F.1    Soumis, F.2    Desrosiers, J.3
  • 13
    • 0034751170 scopus 로고    scopus 로고
    • Simultaneous assignment of locomotives and cars to passenger trains
    • Cordeau, J. F., F. Soumis, J. Desrosiers. 2001. Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49(4) 531-548.
    • (2001) Oper. Res. , vol.49 , Issue.4 , pp. 531-548
    • Cordeau, J.F.1    Soumis, F.2    Desrosiers, J.3
  • 14
    • 0033897386 scopus 로고    scopus 로고
    • The capacitated multiple allocation hub location problema: Formulations and algorithms
    • Ebery, J., M. Krishnamoorthy, A. Ernst, N. Boland. 2000. The capacitated multiple allocation hub location problema: Formulations and algorithms. Eur. J. Oper. Res. 120 614-631.
    • (2000) Eur. J. Oper. Res. , vol.120 , pp. 614-631
    • Ebery, J.1    Krishnamoorthy, M.2    Ernst, A.3    Boland, N.4
  • 15
    • 9544251407 scopus 로고    scopus 로고
    • Hub-and-spoke network design with congestion
    • Elhedhli, S., F. X. Hu. 2005. Hub-and-spoke network design with congestion. Comput. Oper. Res. 32(6) 1615-1632.
    • (2005) Comput. Oper. Res. , vol.32 , Issue.6 , pp. 1615-1632
    • Elhedhli, S.1    Hu, F.X.2
  • 16
    • 0040913897 scopus 로고    scopus 로고
    • Efficient algorithms for the uncapacitated single allocation p-hub median problem
    • Ernst, A. T., M. Krishnamoorthy. 1996. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3) 139-154.
    • (1996) Location Sci. , vol.4 , Issue.3 , pp. 139-154
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 17
    • 0031647407 scopus 로고    scopus 로고
    • Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
    • Ernst, A. T., M. Krishnamoorthy. 1998a. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. 104 100-112.
    • (1998) Eur. J. Oper. Res. , vol.104 , pp. 100-112
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 18
    • 0005036454 scopus 로고    scopus 로고
    • An exact solution approach based on shortest-paths for p-hub median problems
    • Ernst, A. T., M. Krishnamoorthy. 1998b. An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J. Comput. 10(2) 149-162.
    • (1998) INFORMS J. Comput. , vol.10 , Issue.2 , pp. 149-162
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 19
    • 0043096486 scopus 로고    scopus 로고
    • Solution algorithms for the capacitated single allocation hub location problem
    • Ernst, A. T., M. Krishnamoorthy. 1999. Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86 141-159.
    • (1999) Ann. Oper. Res. , vol.86 , pp. 141-159
    • Ernst, A.T.1    Krishnamoorthy, M.2
  • 20
    • 0020125639 scopus 로고
    • Solving stochastic transportationlocation problem by generalized Benders decomposition
    • França, P. M., H. P. L. Luna. 1982. Solving stochastic transportationlocation problem by generalized Benders decomposition. Transportation Sci. 16(2) 113-126.
    • (1982) Transportation Sci. , vol.16 , Issue.2 , pp. 113-126
    • França, P.M.1    Luna, H.P.L.2
  • 21
    • 0015973449 scopus 로고
    • Multicomodity distribution system design by Benders decomposition
    • Geoffrion, A. M., G. W. Graves. 1974. Multicomodity distribution system design by Benders decomposition. Management Sci. 20(5) 822-844.
    • (1974) Management Sci. , vol.20 , Issue.5 , pp. 822-844
    • Geoffrion, A.M.1    Graves, G.W.2
  • 22
    • 0000890585 scopus 로고
    • Optimum distribution of switching centres in a communication network and some related graph theoretic problems
    • Hakimi, S. L. 1965. Optimum distribution of switching centres in a communication network and some related graph theoretic problems. Oper. Res. 13(3) 462-475.
    • (1965) Oper. Res. , vol.13 , Issue.3 , pp. 462-475
    • Hakimi, S.L.1
  • 23
    • 4944226646 scopus 로고    scopus 로고
    • Adapting polyhedral properties from facility to hub location problems
    • Hamacher, H. W., M. Labbé, S. Nickel, T. Sonneborn. 2004. Adapting polyhedral properties from facility to hub location problems. Discrete Appl. Math. 145 104-116.
    • (2004) Discrete Appl. Math. , vol.145 , pp. 104-116
    • Hamacher, H.W.1    Labbé, M.2    Nickel, S.3    Sonneborn, T.4
  • 24
    • 0032070718 scopus 로고    scopus 로고
    • Optimal solution of cellular manufacturing system design: Benders decomposition approach
    • Heragu, S. S., J.-S. Chen. 1998. Optimal solution of cellular manufacturing system design: Benders decomposition approach. Eur. J. Oper. Res. 107 175-192.
    • (1998) Eur. J. Oper. Res. , vol.107 , pp. 175-192
    • Heragu, S.S.1    Chen, J.-S.2
  • 25
    • 0026416927 scopus 로고
    • Heuristics for the p-hub location problem
    • Klincewicz, J. G. 1991. Heuristics for the p-hub location problem. Eur. J. Oper. Res. 53 25-37.
    • (1991) Eur. J. Oper. Res. , vol.53 , pp. 25-37
    • Klincewicz, J.G.1
  • 26
    • 0008097958 scopus 로고    scopus 로고
    • A dual algorithm for the uncapacitated hub location problem
    • Klincewicz, J. G. 1996. A dual algorithm for the uncapacitated hub location problem. Location Sci. 4(3) 173-184.
    • (1996) Location Sci. , vol.4 , Issue.3 , pp. 173-184
    • Klincewicz, J.G.1
  • 27
    • 0000412707 scopus 로고    scopus 로고
    • Hub location in backbone/tributary network design: A review
    • Klincewicz, J. G. 1998. Hub location in backbone/tributary network design: A review. Location Sci. 6(1) 307-335.
    • (1998) Location Sci. , vol.6 , Issue.1 , pp. 307-335
    • Klincewicz, J.G.1
  • 28
    • 0036031834 scopus 로고    scopus 로고
    • Enumeration and search procedures for a hub location problem with economies of scale
    • Klincewicz, J. G. 2002. Enumeration and search procedures for a hub location problem with economies of scale. Ann. Oper. Res. 110 107-122.
    • (2002) Ann. Oper. Res. , vol.110 , pp. 107-122
    • Klincewicz, J.G.1
  • 29
    • 0020722501 scopus 로고
    • Tailoring Benders decomposition for uncapacitated network design
    • Magnanti, T. L., P. Mirchandani, R. T. Wong. 1986. Tailoring Benders decomposition for uncapacitated network design. Math. Programming Stud. 26 112-154.
    • (1986) Math. Programming Stud. , vol.26 , pp. 112-154
    • Magnanti, T.L.1    Mirchandani, P.2    Wong, R.T.3
  • 30
    • 32544439876 scopus 로고    scopus 로고
    • New formulations for the uncapacitated multiple allocation hub location problem
    • Marín, A., L. Cánovas, M. Landete. 2006. New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. 172 274-292.
    • (2006) Eur. J. Oper. Res. , vol.172 , pp. 274-292
    • Marín, A.1    Cánovas, L.2    Landete, M.3
  • 31
    • 0036567974 scopus 로고    scopus 로고
    • Hublocator: An exact solution method for the multiple allocation hub location problem
    • Mayer, G., B. Wagner. 2002. Hublocator: An exact solution method for the multiple allocation hub location problem. Comput. Oper. Res. 29(6) 715-739.
    • (2002) Comput. Oper. Res. , vol.29 , Issue.6 , pp. 715-739
    • Mayer, G.1    Wagner, B.2
  • 32
    • 0022721842 scopus 로고
    • The location of interacting hub facilities
    • O'Kelly, M. E. 1986. The location of interacting hub facilities. Transportation Sci. 20(1) 92-106.
    • (1986) Transportation Sci. , vol.20 , Issue.1 , pp. 92-106
    • O'Kelly, M.E.1
  • 33
    • 0023561366 scopus 로고
    • A quadratic integer program for the location of interacting hub facilities
    • O'Kelly, M. E. 1987. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32 393-404.
    • (1987) Eur. J. Oper. Res. , vol.32 , pp. 393-404
    • O'Kelly, M.E.1
  • 34
    • 0032219180 scopus 로고    scopus 로고
    • Hub location with flow economies of scale
    • O'Kelly, M. E., D. L. Bryan. 1998. Hub location with flow economies of scale. Transportation Res. Part B 32(8) 605-616.
    • (1998) Transportation Res. Part B. , vol.32 , Issue.8 , pp. 605-616
    • O'Kelly, M.E.1    Bryan, D.L.2
  • 36
    • 84881016647 scopus 로고    scopus 로고
    • Hub network design with single and multiple allocation: A computational study
    • O'Kelly, M. E., D. L. Bryan, D. Skorin-Kapov, J. Skorin-Kapov. 1996. Hub network design with single and multiple allocation: A computational study. Location Sci. 4(3) 125-138.
    • (1996) Location Sci. , vol.4 , Issue.3 , pp. 125-138
    • O'Kelly, M.E.1    Bryan, D.L.2    Skorin-Kapov, D.3    Skorin-Kapov, J.4
  • 37
    • 0032298440 scopus 로고    scopus 로고
    • An efficient procedure for designing single allocation hub and spoke systems
    • Pirkul, H., D. A. Schilling. 1998. An efficient procedure for designing single allocation hub and spoke systems. Management Sci. 44(12) 235-242.
    • (1998) Management Sci. , vol.44 , Issue.12 , pp. 235-242
    • Pirkul, H.1    Schilling, D.A.2
  • 38
    • 10444261225 scopus 로고    scopus 로고
    • Optimal location of intermodal freight hubs
    • Racunica, I., L. Wynter. 2005. Optimal location of intermodal freight hubs. Transportation Res. B 39(5) 453-477.
    • (2005) Transportation Res. B. , vol.39 , Issue.5 , pp. 453-477
    • Racunica, I.1    Wynter, L.2
  • 39
    • 0028395729 scopus 로고
    • On tabu search for the location of interacting hub facilities
    • Skorin-Kapov, D., J. Skorin-Kapov. 1994. On tabu search for the location of interacting hub facilities. Eur. J. Oper. Res. 73 501-508.
    • (1994) Eur. J. Oper. Res. , vol.73 , pp. 501-508
    • Skorin-Kapov, D.1    Skorin-Kapov, J.2
  • 40
    • 0002658968 scopus 로고
    • The impact of hub-and-spoke network centralization and route monopoly on domestic airline profitability
    • Toh, R. S., R. R. Higgins. 1985. The impact of hub-and-spoke network centralization and route monopoly on domestic airline profitability. Transportation J. 24 16-27.
    • (1985) Transportation J. , vol.24 , pp. 16-27
    • Toh, R.S.1    Higgins, R.R.2


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