Deliveries in an Inventory /Routing Problem Using Stochastic Dynamic Programming

Berman, Oded; Larson, Richard C.
May 2001
Transportation Science;May2001, Vol. 35 Issue 2, p1
Academic Journal
An industrial gases tanker vehicle visits n customers on a tour, with a possible (n + 1)st customer added at the end. The amount of needed product at each customer is a known random process, typically a Wiener process. The objective is to adjust dynamically the amount of product provided on scene to each customer so as to minimize total expected costs, comprising costs of earliness, lateness, product shortfall, and returning to the depot nonempty. Earliness costs are computed by invocation of an annualized incremental cost argument. Amounts of product delivered to each customer are not known until the driver is on scene at the customer location, at which point the customer is either restocked to capacity or left with some residual empty capacity, the policy determined by stochastic dynamic programming. The methodology has applications beyond industrial gases.


Related Articles

  • ANOTHER FORMULATION OF THE INVENTORY PROBLEM. Sudderth, William H. // Operations Research;May/Jun65, Vol. 13 Issue 3, p504 

    The past decade has given rise to a considerable amount of research in the fields of inventory control and production planning. One of the most useful mathematical models originated with the paper of K. D. ARROW, T. E. HARRIS, AND J. MARSCHAK, "Optimal Inventory Policy," Econometrica 19, 250-272...

  • Modern Strategies for the Costs Optimization of the Logistic Centre. Girvica, Olga // Transport & Engineering;2010, Vol. 34, p123 

    No abstract available.

  • MYOPIC APPROXIMATIONS FOR THE PERISHABLE INVENTORY PROBLEM. Nahmias, Steven // Management Science;May76, Vol. 22 Issue 9, p1002 

    Recent work in describing optimal ordering policies for perishable inventory casts the problem as a multi-dimensional dynamic program, the dimensionality being one less than the useful lifetime of the product, m. As m becomes large the computational problem becomes severe so that developing...

  • Large scale stochastic inventory routing problems with split delivery and service level constraints. Yu, Yugang; Chu, Chengbin; Chen, Haoxun; Chu, Feng // Annals of Operations Research;Aug2012, Vol. 197 Issue 1, p135 

    A stochastic inventory routing problem (SIRP) is typically the combination of stochastic inventory control problems and NP-hard vehicle routing problems, which determines delivery volumes to the customers that the depot serves in each period, and vehicle routes to deliver the volumes. This paper...

  • Optimal Market-Making with Risk Aversion. Kan Huang; Simchi-Levi, David; Miao Song // Operations Research;May/Jun2012, Vol. 60 Issue 3, p541 

    Market-makers have the obligation to trade any given amount of assets at quoted bid or ask prices, and their inventories are exposed to the potential loss when the market price moves in an undesirable direction. One approach to reduce the risk brought by price uncertainty is to adjust the...

  • A HIERARCHY OF DETERMINISTIC PROCUREMENT -- INVENTORY SYSTEMS. Fabrycky, W. J.; Banks, Jerry // Operations Research;Sep/Oct66, Vol. 14 Issue 5, p888 

    The research results reported in this paper present a higher level generalization about deterministic procurement-inventory systems embracing multi-item and multisource characteristics. Lower ordered deterministic systems embracing single-item or single-source characteristics are also presented....

  • SOME INDEXABLE FAMILIES OF RESTLESS BANDIT PROBLEMS. Glazebrook, K. D.; Ruiz-Hernandez, D.; Kirkbride, C. // Advances in Applied Probability;Sep2006, Vol. 38 Issue 3, p643 

    In 1988 Whittle introduced an important but intractable class of restless bandit problems which generalise the multiarmed bandit problems of Gittins by allowing state evolution for passive projects. Whittle's account deployed a Lagrangian relaxation of the optimisation problem to develop an...

  • GENERALIZED DYNAMIC PROGRAMMING FOR STOCHASTIC COMBINATORIAL OPTIMIZATION. Carraway, Robert L.; Morin, Thomas L.; Moskowitz, Herbert // Operations Research;Sep/Oct89, Vol. 37 Issue 5, p819 

    In stochastic versions of combinatorial optimization problems, the objective is to maximize or minimize a function of random variables. For many problems of this type, conventionally applied dynamic programming (DP) may fail to generate an optimal solution due to the potential violation of the...

  • Heuristics for a one-warehouse multiretailer distribution problem with performance bounds. Herer, Yale; Roundy, Robin // Operations Research;Jan/Feb97, Vol. 45 Issue 1, p102 

    We investigate the one warehouse multiretailer distribution problem with traveling salesman tour vehicle routing costs. We model the system in the framework of the more general production/distribution system with arbitrary non-negative monotone joint order costs. We develop polynomial time...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics