A single source transportation problem is an ordinary transportation problem with the additional requirement that the entire demand at each demand location be supplied from a single supply location. It is a special case of Ross and Soland's generalized assignment problem. Such problems occur frequently in applications. This paper gives two heuristic solution methods and a branch and bound algorithm for solving single source transportation problems. A discussion of the branching rules, variable fixing rules, and the computation of weak lower bounds is given. Computational experience with the solution of randomly generated problems having up to 40,000 integer variables is reported. (Author)

  • Corporate Authors:

    Carnegie Mellon University

    Management Sciences Research Group
    Pittsburgh, PA  United States  15213
  • Authors:
    • Nagelhout, R V
    • Thompson, G L
  • Publication Date: 1979-2

Media Info

  • Pagination: 36 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00198397
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Report/Paper Numbers: MSRR-429
  • Contract Numbers: N00014-75-C-0621
  • Files: TRIS
  • Created Date: Oct 17 1980 12:00AM