Deliveries in an inventory/routing problem using stochastic dynamic programming

doi:10.1287/trsc.35.2.192.10134

Deliveries in an inventory/routing problem using stochastic dynamic programming

2001-05-01

59

PRE

AI

DOI：10.1287/trsc.35.2.192.10134

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

VEHICLE-ROUTING PROBLEM

PERIOD

ALLOCATION

ALGORITHM

SYSTEMS

COSTS

Deliveries in an inventory/routing problem using stochastic dynamic programming

Abstract

AI Summary

Journal

Organization