A Stochastic Dynamic Multimode Transportation Model
ResearchPublished 1967
ResearchPublished 1967
A mathematical model and two solution techniques for selecting preferred combinations of different transportation modes over consecutive periods in the face of uncertainty. Some acquaintance with control theory, dynamic programming, and nonlinear programming is assumed. The model is formulated as a problem of optimal stochastic control theory. It assigns individual commodity classes to various carriers, determines which supply points serve which destinations, and reroutes carriers where they will be most effective. It takes account of differential transit times and costs, availabilities, and costs of storage, oversupply, and shortages. Generally, the carrier for a given commodity class will vary over time and place. The system dynamics consist of inventory balance equations relating end-of-period stocks at each point to inflows and outflows. An alternative method is also presented for cases in which the assumptions required for the dynamic programming algorithm are not valid.
This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.