메뉴 건너뛰기




Volumn 210, Issue 3, 2011, Pages 736-744

A solution approach to the inventory routing problem in a three-level distribution system

Author keywords

Distribution; Inventory routing; Logistics; Multi echelon

Indexed keywords

AVERAGE SYSTEM; COMPUTATIONAL RESULTS; DISTRIBUTION; EFFICIENT ALGORITHM; FIXED PARTITION POLICY; INFINITE HORIZONS; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; INVENTORY STRATEGIES; MULTIECHELON; OPTIMAL SOLUTIONS; SINGLE PRODUCT; SOLUTION APPROACH; SUB-PROBLEMS; THREE-LEVEL; WITHOUT SHORTAGE;

EID: 79151471517     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.10.020     Document Type: Article
Times cited : (37)

References (25)
  • 1
    • 0028683516 scopus 로고
    • The general multi-retailer EOQ problem with vehicle routing costs
    • S. Anily The general multi-retailer EOQ problem with vehicle routing costs European Journal of Operational Research 79 3 1994 451 473
    • (1994) European Journal of Operational Research , vol.79 , Issue.3 , pp. 451-473
    • Anily, S.1
  • 2
    • 4944252412 scopus 로고    scopus 로고
    • An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem
    • S. Anily, and J. Bramel An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem Discrete Applied Mathematics 145 1 2004 22 39
    • (2004) Discrete Applied Mathematics , vol.145 , Issue.1 , pp. 22-39
    • Anily, S.1    Bramel, J.2
  • 3
    • 0002211552 scopus 로고
    • One warehouse multiple retailers systems with vehicle routing costs
    • S. Anily, and A. Federgruen One warehouse multiple retailers systems with vehicle routing costs Management Science 36 1 1990 92 113
    • (1990) Management Science , vol.36 , Issue.1 , pp. 92-113
    • Anily, S.1    Federgruen, A.2
  • 4
    • 0020194024 scopus 로고
    • Computational complexity of the capacitated lot size problem
    • G. Bitran, and H. Yanasse Computational complexity of the capacitated lot size problem Management Science 28 10 1982 1174 1186
    • (1982) Management Science , vol.28 , Issue.10 , pp. 1174-1186
    • Bitran, G.1    Yanasse, H.2
  • 5
    • 0001574219 scopus 로고
    • A location based heuristic for general routing problems
    • J. Bramel, and D. Simchi-Levi A location based heuristic for general routing problems Operations Research 43 4 1995 649 660
    • (1995) Operations Research , vol.43 , Issue.4 , pp. 649-660
    • Bramel, J.1    Simchi-Levi, D.2
  • 6
    • 70349745371 scopus 로고    scopus 로고
    • A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
    • M.-C. Bolduc, L. Gilbert, R. Jacques, and F.F. Boctor A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars European Journal of Operational Research 202 1 2010 122 130
    • (2010) European Journal of Operational Research , vol.202 , Issue.1 , pp. 122-130
    • Bolduc, M.-C.1    Gilbert, L.2    Jacques, R.3    Boctor, F.F.4
  • 7
    • 0022059696 scopus 로고
    • Distribution strategies that minimize transportation and inventory costs
    • L.D. Burns, R.W. Hall, D.E. Blumenfeld, and C.F. Daganzo Distribution strategies that minimize transportation and inventory costs Operations Research 33 3 1985 469 490
    • (1985) Operations Research , vol.33 , Issue.3 , pp. 469-490
    • Burns, L.D.1    Hall, R.W.2    Blumenfeld, D.E.3    Daganzo, C.F.4
  • 8
    • 10644237167 scopus 로고    scopus 로고
    • A decomposition approach for the inventory-routing problem
    • A. Campbell, and M. Savelsbergh A decomposition approach for the inventory-routing problem Transportation Science 38 4 2004 488 502
    • (2004) Transportation Science , vol.38 , Issue.4 , pp. 488-502
    • Campbell, A.1    Savelsbergh, M.2
  • 9
    • 0031701710 scopus 로고    scopus 로고
    • Probabilistic analyses and practical algorithms for inventory-routing problems
    • L.M.A. Chan, A. Federgruen, and D. Simchi-Levi Probabilistic analyses and practical algorithms for inventory-routing problems Operations Research 46 1 1998 96 106
    • (1998) Operations Research , vol.46 , Issue.1 , pp. 96-106
    • Chan, L.M.A.1    Federgruen, A.2    Simchi-Levi, D.3
  • 10
    • 0032209061 scopus 로고    scopus 로고
    • Probabilistic analyses and algorithms for three-level distribution systems
    • L.M.A. Chan, and D. Simchi-Levi Probabilistic analyses and algorithms for three-level distribution systems Management Science 44 11 1998 1562 1576
    • (1998) Management Science , vol.44 , Issue.11 , pp. 1562-1576
    • Chan, L.M.A.1    Simchi-Levi, D.2
  • 11
    • 0001537142 scopus 로고
    • 2) algorithm for the NI/G/NI/ND capacitated lot size problem
    • 2) algorithm for the NI/G/NI/ND capacitated lot size problem Management Science 34 3 1988 420 426
    • (1988) Management Science , vol.34 , Issue.3 , pp. 420-426
    • Chung, C.-S.1    Lin, C.M.2
  • 12
    • 0043059830 scopus 로고
    • Savings by split delivery routing
    • M. Dror, and P. Trudeau Savings by split delivery routing Transportation Science 23 2 1989 141 145
    • (1989) Transportation Science , vol.23 , Issue.2 , pp. 141-145
    • Dror, M.1    Trudeau, P.2
  • 13
    • 12344296838 scopus 로고    scopus 로고
    • A periodic inventory routing problem at a supermarket chain
    • V. Gaur, and M.L. Fisher A periodic inventory routing problem at a supermarket chain Operations Research 52 6 2004 813 822
    • (2004) Operations Research , vol.52 , Issue.6 , pp. 813-822
    • Gaur, V.1    Fisher, M.L.2
  • 14
    • 0000866856 scopus 로고
    • New insertion and postoptimization procedures for the traveling salesman problem
    • M. Gendreau, A. Hertz, and G. Laporte New insertion and postoptimization procedures for the traveling salesman problem Operations Research 40 6 1992 1086 1094
    • (1992) Operations Research , vol.40 , Issue.6 , pp. 1086-1094
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 15
    • 77952672360 scopus 로고    scopus 로고
    • A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty
    • S.-H. Huang, and P.-C. Lin A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty Transportation Research Part E 46 5 2010 598 611
    • (2010) Transportation Research Part e , vol.46 , Issue.5 , pp. 598-611
    • Huang, S.-H.1    Lin, P.-C.2
  • 16
    • 34247546094 scopus 로고    scopus 로고
    • An efficient heuristic algorithm for a two-echelon joint inventory and routing problem
    • J. Jung, and K. Mathur An efficient heuristic algorithm for a two-echelon joint inventory and routing problem Transportation Science 41 1 2007 55 73
    • (2007) Transportation Science , vol.41 , Issue.1 , pp. 55-73
    • Jung, J.1    Mathur, K.2
  • 17
    • 0036474928 scopus 로고    scopus 로고
    • The stochastic inventory routing problem with direct deliveries
    • A.J. Kleywegt, V.S. Nori, and M.W.P. Savelsbergh The stochastic inventory routing problem with direct deliveries Transportation Science 36 1 2002 94 118
    • (2002) Transportation Science , vol.36 , Issue.1 , pp. 94-118
    • Kleywegt, A.J.1    Nori, V.S.2    Savelsbergh, M.W.P.3
  • 18
    • 70349943939 scopus 로고    scopus 로고
    • Performance evaluation of distribution strategies for the inventory routing problem
    • J. Li, H. Chen, and F. Chu Performance evaluation of distribution strategies for the inventory routing problem European Journal of Operational Research 202 2 2010 412 419
    • (2010) European Journal of Operational Research , vol.202 , Issue.2 , pp. 412-419
    • Li, J.1    Chen, H.2    Chu, F.3
  • 19
  • 20
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling-salesman problem
    • K. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling-salesman problem Operations Research 21 2 1973 498 516
    • (1973) Operations Research , vol.21 , Issue.2 , pp. 498-516
    • Lin, K.1    Kernighan, B.W.2
  • 22
    • 0022162807 scopus 로고
    • 98% Effective integer-ratio lot sizing for one-warehouse multi-retailer systems
    • R.O. Roundy 98% Effective integer-ratio lot sizing for one-warehouse multi-retailer systems Management Science 31 11 1985 1416 1430
    • (1985) Management Science , vol.31 , Issue.11 , pp. 1416-1430
    • Roundy, R.O.1
  • 23
    • 51249123331 scopus 로고    scopus 로고
    • A practical solution approach for the cyclic inventory routing problem
    • B. Raa, and E.-H. Aghezzaf A practical solution approach for the cyclic inventory routing problem European Journal of Operational Research 192 2 2009 429 441
    • (2009) European Journal of Operational Research , vol.192 , Issue.2 , pp. 429-441
    • Raa, B.1    Aghezzaf, E.-H.2
  • 25
    • 44649089978 scopus 로고    scopus 로고
    • Model and algorithm for inventory/routing decision in a three-echelon logistics system
    • Q.-H. Zhao, S. Chen, and C.-X. Zang Model and algorithm for inventory/routing decision in a three-echelon logistics system European Journal of Operational Research 191 3 2008 623 635
    • (2008) European Journal of Operational Research , vol.191 , Issue.3 , pp. 623-635
    • Zhao, Q.-H.1    Chen, S.2    Zang, C.-X.3


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