A probabilistic analysis of a fixed partition policy for the inventory-routing problem

Naval Research Logistics

Volumn 51, Issue 7, 2004, Pages 925-948

  Anily, Shoshaha ^a   Bramel, Julien ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FIXED PARTITION POLICIES (FPP); INVENTORY ROUTING PROBLEMS (IRP); TRANSPORTATION PLANNING; VENDOR MANAGED INVENTORY (VMI);

COSTS; LOGISTICS; MATHEMATICAL MODELS; PLANNING; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

INVENTORY CONTROL;

EID: 6344267061     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.20031     Document Type: Article

References (26)

1. S. Anily, The general multi-retailer EOQ problem with vehicle routing costs, European J Oper Res 79 (1994), 451-473.
2. S. Anily and J. Bramel, "Vehicle routing and the supply chain," Quantitative models for supply chain management, S. Tayur, R. Ganeshan, and M. Magazine (Editors), Kluwer, Dordrecht, 1998, pp. 147-196.
3. S. Anily and J. Bramel, An asymptotic 98.5%-effective lower bound on fixed partition policy for the inventory-routing problem, Discrete Appl Math, To appear.
4. S. Anily and A. Federgruen, A class of Euclidean routing problems with general route cost functions, Math Oper Res 15 (1990), 268-285.
5. S. Anily and A. Federgruen, One warehouse multiple retailer systems with vehicle routing costs, Management Sci 36 (1990), 92-114.
6. S. Anily and A. Federgruen, Rejoinder to "Comments on 'One warehouse multiple retailer systems with vehicle routing costs,'" Management Sci 37 (1991), 1498-1499.
7. S. Anily and A. Federgruen, Two-echelon distribution systems with vehicle routing and central inventories, Special Issue on Stochastic and Dynamic Models in Transportation [M. Dror (Editor)] Oper Res 41 (1993), 37-47.
8. J. Bramel and D. Simchi-Levi, A location based heuristic for general routing problems, Oper Res 43 (1995), 649-660.
9. L.M.A. Chan, A. Federgruen, and D. Simchi-Levi, Probabilistic analyses and practical algorithms for inventory-routing models, Oper Res 46 (1998), 96-106.
10. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
11. E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, "Approximation algorithms for bin-packing - an updated survey," Algorithm design for computer system design, G. Ausiello, M. Lucertini, and P. Serafini (Editors), Springer-Verlag, New York, 1984, pp. 49-106.
12. E.G. Coffman, Jr. and G.S. Lueker, Probabilistic analysis of packing and partitioning algorithms, Wiley, New York, 1991.
13. 1 view, Wiley, New York, 1985.
14. A. Federgruen and G. van Ryzin, Probabilistic analysis of a generalized bin-packing problem and applications, Oper Res 45 (1997), 596-609.
15. G. Gallego and D. Simchi-Levi, On the effectiveness of direct shipping strategy for the one warehouse multi-retailer R-systems, Management Sci 36 (1990), 240-243.
16. M. Haimovich and A.H.G. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math Oper Res 10 (1985), 527-542.
17. R.W. Hall, Comments on "One warehouse multiple retailer systems with vehicle routing costs," Management Sci 37 (1991), 1496-1497.
18. K. Karlin and H.M. Taylor, A first course in stochastic processes, Academic, San Diego, CA, 1975.
19. N. Karmarkar and R.M. Karp, The differencing method for set partitioning, Technical Report, University of California, Berkeley, CA, 1982.
20. R.M. Karp, Probabilistic analysis of partitioning algorithms for the traveling salesman problem, Math Oper Res 2 (1977), 209-224.
21. J.F.C. Kingman, Subadditive processes, Lecture Notes in Mathematics 539, Springer-Verlag, Berlin, 1976.
22. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, The traveling salesman problem: A guided tour of combinatorial optimization, Wiley, New York, 1985.
23. A. Rényi, Probability theory, North-Holland, Amsterdam, 1970.
24. W.T. Rhee and M. Talagrand, Martingale inequalities and N-P-complete problems, Math Oper Res 12 (1987), 177-181.
25. G. Stalk, P. Evans, and L.E. Shulman, Competing on capabilities: The new rule of corporate strategy, Harvard Bus Rev 70 (1992), 57-69.
26. S. Yuyue, Lot sizing production models and inventory routing problems, Ph.D. dissertation, National University of Singapore, 2000.