IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v3y1969i1p8-29.html
   My bibliography  Save this article

A Stochastic Multiperiod Multimode Transportation Model

Author

Listed:
  • Joseph L. Midler

    (The Rand Corporation, Santa Monica, California)

Abstract

This paper develops a dynamic programming model for selecting an optimal combination of transportation modes over a midtiperiod planning horizon. The formulation explicitly incorporates uncertainty regarding future requirements or demands for a number of commodity classes. In addition to determining the optimal modes to employ, the model assigns individual commodity classes to various modes, determines which supply points serve which destinations, and reroutes carriers from destinations to alternative sources where they will be most effective. The model is formulated as an optimal discrete time stochastic control problem where cost is quadratic and dynamic equations linear in the state and control variables. This model may be solved in closed form by an efficient dynamic programming algorithm that permits the treatment of relatively large scale systems. Also developed is an alternative, generally suboptimal method of solution, based upon solving a sequence of convex programming problems over time. This technique may be employed for a more general class of problems. In both methods the use of “shadow prices” that arise is discussed.

Suggested Citation

  • Joseph L. Midler, 1969. "A Stochastic Multiperiod Multimode Transportation Model," Transportation Science, INFORMS, vol. 3(1), pages 8-29, February.
  • Handle: RePEc:inm:ortrsc:v:3:y:1969:i:1:p:8-29
    DOI: 10.1287/trsc.3.1.8
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.3.1.8
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.3.1.8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:3:y:1969:i:1:p:8-29. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.