Standard Article

Transportation Algorithms

  1. Douglas S. Altner1,
  2. J. Paul Brooks2

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms0918

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Altner, D. S. and Brooks, J. P. 2011. Transportation Algorithms. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. 1

    United States Naval Academy, Department of Mathematics, Annapolis, Maryland

  2. 2

    Virginia Commonwealth University, Department of Statistical Sciences and Operations Research, Richmond, Virginia

Publication History

  1. Published Online: 15 FEB 2011

Abstract

The transportation problem requires, given a set of suppliers and a set of customers, finding a minimum cost plan to determine how many goods each supplier should send to each customer. Each customer's minimum requirements must be satisfied without exceeding the supply of any supplier. This problem has a plethora of industrial and military applications including applications beyond modeling the physical transporting of goods. In this article, we present the transportation problem; discuss its early history, properties, and relationship to other problems; describe the well-known transportation simplex method; and survey the literature on transportation algorithms.

Keywords:

  • transportation problem;
  • transportation simplex method;
  • transshipment problem;
  • stepping-stone method;
  • transportation tableaus