메뉴 건너뛰기




Volumn 41, Issue 3, 2007, Pages 382-391

A branch-and-cut algorithm for a vendor-managed inventory-routing problem

Author keywords

Branch and cut; Deterministic order up to level; Inventory routing problem; Supply chain management; Vendor managed inventory (vmi)

Indexed keywords

OPTIMAL SYSTEMS; ROUTING ALGORITHMS; SALES; SHIPS; SUPPLY CHAIN MANAGEMENT;

EID: 67349167929     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1060.0188     Document Type: Article
Times cited : (362)

References (24)
  • 1
    • 4544373774 scopus 로고    scopus 로고
    • A price-directed approach to stochastic inventory/routing
    • Adelman, D. 2004. A price-directed approach to stochastic inventory/routing. Oper. Res. 52 499-514.
    • (2004) Oper. Res. , vol.52 , pp. 499-514
    • Adelman, D.1
  • 2
    • 0002211552 scopus 로고
    • One warehouse multiple retailer systems with vehicle routing costs
    • Anily, S., A. Federgruen. 1990. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. 36 92-114.
    • (1990) Management Sci. , vol.36 , pp. 92-114
    • Anily, S.1    Federgruen, A.2
  • 3
    • 0035466860 scopus 로고    scopus 로고
    • A note on stock replenishment and Shipment scheduling for vendor-managed inventory systems
    • Axsäter, S. 2001. A note on stock replenishment and shipment scheduling for vendor-managed inventory systems. Management Sci. 47 1306-1310.
    • (2001) Management Sci. , vol.47 , pp. 1306-1310
    • Axsäter, S.1
  • 4
    • 0028769377 scopus 로고
    • Multi-level production-inventory control: Material requirements planning or reorder point policies?
    • Axsäter, S., K. Rosling. 1994. Multi-level production-inventory control: Material requirements planning or reorder point policies? Eur. J. Oper. Res. 75 405-412.
    • (1994) Eur. J. Oper. Res. , vol.75 , pp. 405-412
    • Axsäter, S.1    Rosling, K.2
  • 5
    • 0036474929 scopus 로고    scopus 로고
    • Deterministic orderup-to level policies in an inventory routing problem
    • Bertazzi, L., G. Paletta, M. G. Speranza. 2002. Deterministic orderup-to level policies in an inventory routing problem. Transportation Sci. 36 119-132.
    • (2002) Transportation Sci. , vol.36 , pp. 119-132
    • Bertazzi, L.1    Paletta, G.2    Speranza, M.G.3
  • 6
    • 26844451403 scopus 로고    scopus 로고
    • Minimizing the total cost in an integrated vendor-managed inventory system
    • Bertazzi, L., G. Paletta, M. G. Speranza. 2005. Minimizing the total cost in an integrated vendor-managed inventory system. J. Heuristics 11 393-419.
    • (2005) J. Heuristics , vol.11 , pp. 393-419
    • Bertazzi, L.1    Paletta, G.2    Speranza, M.G.3
  • 9
    • 10644237167 scopus 로고    scopus 로고
    • A decomposition approach for the inventory-routing problem
    • Campbell, A. M., M. W. P. Savelsbergh. 2004. A decomposition approach for the inventory-routing problem. Transportation Sci. 38 488-502.
    • (2004) Transportation Sci. , vol.38 , pp. 488-502
    • Campbell, A.M.1    Savelsbergh, M.W.P.2
  • 11
    • 0033902373 scopus 로고    scopus 로고
    • Stock replenishment and Shipment scheduling for vendor-managed inventory systems
    • Çetinkaya, S., C.-Y. Lee. 2000. Stock replenishment and shipment scheduling for vendor-managed inventory systems. Management Sci. 46 217-232.
    • (2000) Management Sci. , vol.46 , pp. 217-232
    • Çetinkaya, S.1    Lee, C.-Y.2
  • 12
    • 0032209061 scopus 로고    scopus 로고
    • Probabilistic analyses and algorithms for three-level distribution systems
    • Chan, L. M. A., D. Simchi-Levi. 1998. Probabilistic analyses and algorithms for three-level distribution systems. Management Sci. 44 1562-1576. (Pubitemid 128617771)
    • (1998) Management Science , vol.44 , Issue.11 PART 1 , pp. 1562-1576
    • Chan, L.M.A.1    Simchi-Levi, D.2
  • 13
    • 0036475290 scopus 로고    scopus 로고
    • The inventory benefit of Shipment coordination and stock rebalancing in a supply chain
    • Cheung, K. L., H. L. Lee. 2002. The inventory benefit of shipment coordination and stock rebalancing in a supply chain. Management Sci. 48 300-306.
    • (2002) Management Sci. , vol.48 , pp. 300-306
    • Cheung, K.L.1    Lee, H.L.2
  • 14
    • 0023563839 scopus 로고
    • Inventory/routing: Reduction from an annual to a short-period problem
    • Dror, M., M. Ball. 1987. Inventory/routing: Reduction from an annual to a short-period problem. Naval Res. Logist. Quart. 34 891-905.
    • (1987) Naval Res. Logist. Quart , vol.34 , pp. 891-905
    • Dror, M.1    Ball, M.2
  • 15
    • 0021489143 scopus 로고
    • A combined vehicle routing and inventory allocation problem
    • Federgruen, A., P. Zipkin. 1984. A combined vehicle routing and inventory allocation problem. Oper. Res. 32 1019-1032.
    • (1984) Oper. Res. , vol.32 , pp. 1019-1032
    • Federgruen, A.1    Zipkin, P.2
  • 17
    • 0346449638 scopus 로고    scopus 로고
    • Coordinating production and delivery under a (z, z)-type vendor-managed inventory contract
    • Fry, M. J., R. Kapuscinski, T. L. Olsen. 2001. Coordinating production and delivery under a (z, Z)-type vendor-managed inventory contract. Manufacturing Service Oper. Management 3 151-173.
    • (2001) Manufacturing Service Oper. Management , vol.3 , pp. 151-173
    • Fry, M.J.1    Kapuscinski, R.2    Olsen, T.L.3
  • 18
    • 0039392730 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the undirected selective traveling salesman problem
    • Gendreau, M., G. Laporte, F. Semet. 1998. A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32 263-273. (Pubitemid 128365136)
    • (1998) Networks , vol.32 , Issue.4 , pp. 263-273
    • Gendreau, M.1    Laporte, G.2    Semet, F.3
  • 19
    • 0036474928 scopus 로고    scopus 로고
    • The stochastic inventory routing problem with direct deliveries
    • Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2002. The stochastic inventory routing problem with direct deliveries. Transportation Sci. 36 94-118.
    • (2002) Transportation Sci. , vol.36 , pp. 94-118
    • Kleywegt, A.J.1    Nori, V.S.2    Savelsbergh, M.W.P.3
  • 20
    • 1642324107 scopus 로고    scopus 로고
    • Dynamic programming approximations for a stochastic inventory routing problem
    • Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2004. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Sci. 38 42-70.
    • (2004) Transportation Sci. , vol.38 , pp. 42-70
    • Kleywegt, A.J.1    Nori, V.S.2    Savelsbergh, M.W.P.3
  • 21
    • 0026124209 scopus 로고
    • A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
    • Padberg, M., G. Rinaldi. 1991. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33 60-100.
    • (1991) SIAM Rev , vol.33 , pp. 60-100
    • Padberg, M.1    Rinaldi, G.2
  • 22
    • 0012773570 scopus 로고    scopus 로고
    • Impact of electronic commerce on logistics operations: A focus on vendor managed inventory (vmi) strategies
    • Center for Transportation Research, University of Texas at Austin, Austin, TX
    • Rabah, M. Y., H. S. Mahmassani. 2002. Impact of electronic commerce on logistics operations: A focus on vendor managed inventory (VMI) strategies. Technical Report N. SWUTC/02/167227-1, Center for Transportation Research, University of Texas at Austin, Austin, TX.
    • (2002) Technical Report N. SWUTC/02/167227-1
    • Rabah, M.Y.1    Mahmassani, H.S.2
  • 23
    • 33749650757 scopus 로고    scopus 로고
    • Inventory routing with continuous moves
    • Savelsbergh, M., J. H. Song. 2006. Inventory routing with continuous moves. Comput. Oper. Res. 34 1744-1763.
    • (2006) Comput. Oper. Res. , vol.34 , pp. 1744-1763
    • Savelsbergh, M.1    Song, J.H.2


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