메뉴 건너뛰기




Volumn 39, Issue 2, 2011, Pages 138-143

A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations

Author keywords

Benders decomposition; Consolidation; Network design

Indexed keywords

BENDERS DECOMPOSITION; COMPUTATIONAL STUDIES; DE-CONSOLIDATION; DESIGN DECISIONS; DISTRIBUTION NETWORK; NETWORK DESIGN; NETWORK DESIGN PROBLEMS; SOLUTION APPROACH;

EID: 79953055779     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2011.02.003     Document Type: Article
Times cited : (33)

References (22)
  • 1
    • 0032050759 scopus 로고    scopus 로고
    • A hybrid heuristic for the uncapacitated hub location problem
    • PII S0377221797002865
    • S. Abdinnour-Helm A hybrid heuristic for the uncapacitated hub location problem European Journal of Operational Research 106 2 1998 489 499 (Pubitemid 128399664)
    • (1998) European Journal of Operational Research , vol.106 , Issue.2-3 , pp. 489-499
    • Abdinnour-Helm, S.1
  • 3
    • 0031104331 scopus 로고    scopus 로고
    • New formulation and relaxation to solve a concave-cost network flow problem
    • A. Amiri, and H. Pirkul New formulation and relaxation to solve a concave-cost network flow problem Journal of Operational Research Society 48 1997 278 287 (Pubitemid 127608038)
    • (1997) Journal of the Operational Research Society , vol.48 , Issue.3 , pp. 278-287
    • Amiri, A.1    Pirkul, H.2
  • 4
    • 0012649845 scopus 로고    scopus 로고
    • On capacitated network design cut-set polyhedra
    • A. Atamtrk On capacitated network design cut-set polyhedra Mathematical Programming, Series B 92 2002 425 437
    • (2002) Mathematical Programming, Series B , vol.92 , pp. 425-437
    • Atamtrk, A.1
  • 5
    • 84987049372 scopus 로고
    • A composite algorithm for a concave-cost network flow problem
    • A. Balakrishnan, and S.C. Graves A composite algorithm for a concave-cost network flow problem Networks 19 1989 175 202
    • (1989) Networks , vol.19 , pp. 175-202
    • Balakrishnan, A.1    Graves, S.C.2
  • 6
    • 9644308639 scopus 로고
    • Partitioning procedures for solving mixed-variables programming problems
    • J.F. Benders Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 1962 238 252
    • (1962) Numerische Mathematik , vol.4 , pp. 238-252
    • Benders, J.F.1
  • 8
    • 0028259333 scopus 로고
    • Integer programming formulations of discrete hub location problems
    • J.F. Campbell Integer programming formulations of discrete hub location problems European Journal of Operational Research 72 1994 387 405
    • (1994) European Journal of Operational Research , vol.72 , pp. 387-405
    • Campbell, J.F.1
  • 10
    • 33748253462 scopus 로고    scopus 로고
    • A hybrid heuristic for the uncapacitated single allocation hub location problem
    • J.F. Chen A hybrid heuristic for the uncapacitated single allocation hub location problem Omega 35 2 2007 211 220
    • (2007) Omega , vol.35 , Issue.2 , pp. 211-220
    • Chen, J.F.1
  • 11
    • 33845932344 scopus 로고    scopus 로고
    • A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
    • DOI 10.1016/j.ejor.2005.03.057, PII S0377221705007344
    • C.B. Cunha, and M.R. Silva A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil European Journal of Operational Research 127 3 2007 747 758 (Pubitemid 46038587)
    • (2007) European Journal of Operational Research , vol.179 , Issue.3 , pp. 747-758
    • Cunha, C.B.1    Silva, M.R.2
  • 12
    • 0033897386 scopus 로고    scopus 로고
    • Capacitated multiple allocation hub location problem: Formulations and algorithms
    • DOI 10.1016/S0377-2217(98)00395-6
    • J. Ebery, M. Krishnamoorthy, A.T. Ernst, and N. Boland The capacitated multiple allocation hub location problem: Formulation and algorithms European Journal of Operational Research 120 2000 614 631 (Pubitemid 30516821)
    • (2000) European Journal of Operational Research , vol.120 , Issue.3 , pp. 614-631
    • Ebery, J.1    Krishnamoorthy, M.2    Ernst, A.3    Boland, N.4
  • 13
    • 0032025650 scopus 로고    scopus 로고
    • Solving the uncapacitated network design problem by a lagrangean heuristic and branch-and-bound
    • K. Holmberg, and J. Hellstrand Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound Operations Research 46 2 1998 247 259 (Pubitemid 128655398)
    • (1998) Operations Research , vol.46 , Issue.2 , pp. 247-259
    • Holmberg, K.1    Hellstrand, J.2
  • 14
  • 15
    • 0001258594 scopus 로고
    • Modeling and solving the two-facility capacitated network loading problem
    • T.L. Magnanti, P. Mirchandani, and R. Vachani Modeling and solving the two-facility capacitated network loading problem Operations Research 43 1 1995 142 157
    • (1995) Operations Research , vol.43 , Issue.1 , pp. 142-157
    • Magnanti, T.L.1    Mirchandani, P.2    Vachani, R.3
  • 16
    • 0020722501 scopus 로고
    • Tailoring benders decomposition for uncapacitated network design problem
    • T.L. Magnanti, P. Mireault, and R. Wong Tailoring benders decomposition for uncapacitated network design problem Mathematical Programming 26 1986 112 154
    • (1986) Mathematical Programming , vol.26 , pp. 112-154
    • Magnanti, T.L.1    Mireault, P.2    Wong, R.3
  • 17
    • 0019563311 scopus 로고
    • Accelerating benders decomposition: Algorithmic enhancement and model selection criteria
    • T.L. Magnanti, and R.T. Wong Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria Operations Research 29 3 1981 464 484 (Pubitemid 12437576)
    • (1981) Operations Research , vol.29 , Issue.3 , pp. 464-484
    • Magnanti, T.L.1    Wong, R.T.2
  • 18
    • 19944364954 scopus 로고    scopus 로고
    • Formulating and solving splittable capacitated multiple allocation hub location problems
    • DOI 10.1016/j.cor.2004.04.008, PII S0305054804000930
    • A. Marin Formulating and solving splittable capacitated multiple allocation hub location problems Computers and Operations Research 32 12 2005 3093 3109 (Pubitemid 40749366)
    • (2005) Computers and Operations Research , vol.32 , Issue.12 , pp. 3093-3109
    • Marin, A.1
  • 19
    • 2942644434 scopus 로고    scopus 로고
    • Capacitated multicommodity network flow problems with piecewise linear concave costs
    • A. Muriel, and F.N. Munshi Capacitated multicommodity network flow problems with piecewise linear concave costs IIE Transactions 36 2003 683 696
    • (2003) IIE Transactions , vol.36 , pp. 683-696
    • Muriel, A.1    Munshi, F.N.2
  • 20
    • 38949102636 scopus 로고    scopus 로고
    • Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
    • DOI 10.1007/s10589-007-9069-1
    • M. Randall Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation Journal Computational Optimization and Applications 39 2 2008 239 261 (Pubitemid 351214607)
    • (2008) Computational Optimization and Applications , vol.39 , Issue.2 , pp. 239-261
    • Randall, M.1
  • 21
    • 0022613611 scopus 로고
    • A cross decomposition algorithm for capacitated facility location
    • T.J. Van Roy A cross decomposition algorithm for capacitated facility location Operations Research 34 1986 145 163
    • (1986) Operations Research , vol.34 , pp. 145-163
    • Van Roy, T.J.1
  • 22
    • 0030364463 scopus 로고    scopus 로고
    • Accelerating Benders' decomposition for the capacitated facility location problem
    • P. Wentges Accelerating Benders decomposition for the capacitated facility location problem Mathematical Methods of Operations Research 44 2 1996 267 290 (Pubitemid 126578766)
    • (1996) Mathematical Methods of Operations Research , vol.44 , Issue.2 , pp. 267-290
    • Wentges, P.1


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