SEPARABLE PROGRAMMING APPLIED TO THE STOCHASTIC TRANSPORTATION PROBLEM

This paper describes a solution method based on separable programming techniques for the stochastic transportation problem. An enlarged linear network problem is obtained and solved, producing a very efficient solution method. The difficulty of accuracy estimation is discussed, and a procedure using the dual variables to solve the lagrangian relaxation of the problem is described. The solution method is compared to some other methods for the STP. (Author/TRRL)

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/03482960
• Corporate Authors:

  Linkoeping University, Sweden

  Department of Mathematics
  S-58183 Linkoeping,   Sweden 
• Authors:
  • Holmberg, K
• Publication Date: 1984

Media Info

• Features: Figures; References; Tables;
• Pagination: 53 p.
• Serial:
  • Publication of: Linkoeping University, Sweden
  • Publisher: Linkoeping University, Sweden
  • ISSN: 0348-2960

Subject/Index Terms

• TRT Terms: Accuracy; Computer programs; Linear systems; Stochastic processes; Transportation; Variables
• Uncontrolled Terms: Stochastic
• ITRD Terms: 6440: Error; 6484: Linear system; 8645: Software; 6574: Stochastic process; 1155: Transport
• Subject Areas: Operations and Traffic Management; Planning and Forecasting; Transportation (General); I71: Traffic Theory; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00391287
• Record Type: Publication
• Source Agency: Swedish National Road and Transport Research Institute (VTI)
• Report/Paper Numbers: 84-15 Monograph
• Files: ITRD, TRIS
• Created Date: Jan 30 1985 12:00AM