TRANSPORTATION PROBLEMS WITH INADMISSIBLE ROUTES

Transportation problems with inadmissible routes (routes that cannot be used) need not have a feasible solution, even if the total supply exceeds the total demand. A method for adjusting the demands equitably to obtain a feasible solution is presented. The algorithm used generates a feasible minimum cost solution in roughly twice the amount of time that it would take to solve a transportation problem of the same size. It is shown how the solution time is reduced by aggregating the adjustment of demands and decomposing the cost minimization.

• Corporate Authors:

  National Research Institute for Mathematical Sci

  P.O. Box 395
  Pretoria 0001, Transvaal,   South Africa 
• Authors:
  • Currin, D C
• Publication Date: 1985-5

Media Info

• Pagination: 25 p.

Subject/Index Terms

• TRT Terms: Algorithms; Costs; Demand; Optimization; Routes; Routing; Supply; Transportation planning
• Uncontrolled Terms: Supply and demand
• Subject Areas: Finance; Highways; Operations and Traffic Management; Planning and Forecasting;

Filing Info

• Accession Number: 00471017
• Record Type: Publication
• Source Agency: National Technical Information Service
• Report/Paper Numbers: CSIR-TWISK-403
• Files: TRIS
• Created Date: May 31 1988 12:00AM