A Single Source Transportation Algorithm.

Abstract

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1979
Accession Number
ADA068237

Entities

People

  • Gerald L. Thompson
  • Robert V. Nagelhout

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Heuristic Methods
  • Integer Programming
  • Integrals
  • Military Applications
  • Military Research
  • Operations Research
  • Probability
  • Probability Distributions
  • Transportation
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research