The stochastic inventory routing problem with direct deliveries

Transportation Science

Volumn 36, Issue 1, 2002, Pages 94-118

  Kleywegt, Anton J ^a   Nori, Vijay S ^a   Savelsbergh, Martin W P ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; INVENTORY CONTROL; MARKOV PROCESSES; TRANSPORTATION;

INVENTORY ROUTING PROBLEM (IRP);

PROBLEM SOLVING;

EID: 0036474928     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.36.1.94.574     Document Type: Article

References (55)

1. One warehouse multiple retailer systems with vehicle routing costs
2. Two-echelon distribution systems with vehicle routing costs and central inventories
3. A decomposition approach to the inventory routing problem with satelitte facilities
4. Direct shipping and the dynamic single-depot/multi-retailer inventory system
5. Dynamic allocations for multi-product distribution
6. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer
7. An analysis of inventory and transportation costs in a constrained network
8. Convergence of discretization procedures in dynamic programming
9. Synchronizing production and transportation schedules
10. Analyzing trade-offs between transportation, inventory and production costs on freight networks
11. On the application of the theory of Galois fields to the problem of construction of Hyper-Graeco-Latin Squares
12. Orthogonal arrays of strength two and three
13. Distribution strategies that minimize transportation and inventory costs
14. The inventory routing problem
15. Stock replenishment and shipment scheduling for vendor managed inventory systems
16. Probabilistic analysis and practical algorithms for inventory-routing models
17. Coordination of production and distribution planning
18. Determining profit-maximizing production/shipping policies in a one-to-one direct shipping, stochastic demand environment
19. An integrated inventory allocation and vehicle routing problem
20. An optimal one-way multigrid algorithm for discrete-time stochastic control
21. Decomposition of a combined inventory and time constrained Ship routing problem
22. A method for solving ship routing problems with inventory constraints
23. Modelling path flows for a combined ship routing and inventory management problem
24. Strategic analysis of integrated production-distribution systems: Models and methods
25. Inventory/routing: Reduction from an annual to a short period problem
26. Cash flow optimization in delivery scheduling
27. A computational comparison of algorithms for the inventory routing problem
28. Analysis of vehicle routing and inventory-routing problems
29. A combined vehicle routing and inventory allocation problem
30. Synchronized development of production, inventory, and distribution schedules
31. On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems
32. Analysis of a large scale vehicle routing problem with an inventory component
33. Bounds and heuristics for capacitated routing problems
34. Delivery cost approximations for inventory rating problems in a rolling horizon framework
35. A Markov decision model and decomposition heuristic for dynamic vehicle dispatching
36. Numerical quadrature in n dimensions
37. Optimizing inventory levels in a two-echelon retailer system with partial lost sales
38. Using common random numbers for indifference-zone selection and multiple comparisons in simulation
39. Performance characteristics of stochastic integrated production-distribution systems
40. Multiproduct integrated production-distribution systems
41. Heavy traffic analysis of the dynamic stochastic inventory-routing problem
42. A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems
43. Coordinated supply chain management
44. Stochastic inventory routing: Route design with stockouts and route failures
45. An analysis of temporal-difference learning with function approximation