A STOCHASTIC DYNAMIC MULTIMODE TRANSPORTATION MODEL

A MATHEMATICAL MODEL AND TWO SOLUTION TECHNIQUES FOR SELECTING PREFERRED COMBINATIONS OF DIFFERENT TRANSPORTATION MODES OVER CONSECUTIVE PERIODS IN THE FACE OF UNCERTAINTY ARE DEVELOPED. 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, 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. /AUTHOR/

  • Corporate Authors:

    RAND Corporation

    1776 Main Street, P.O. Box 2138
    Santa Monica, CA  United States  90407-2138
  • Authors:
    • Midler, J L
  • Publication Date: 1967-7

Subject/Index Terms

Filing Info

  • Accession Number: 00201780
  • Record Type: Publication
  • Source Agency: Traffic Systems Reviews & Abstracts
  • Report/Paper Numbers: Memo Rm-5250-pr
  • Files: TRIS
  • Created Date: Jul 27 1970 12:00AM