DYNAMIC TRANSSHIPMENT NETWORKS: AN ALGORITHM AND ITS APPLICATION TO THE DISTRIBUTION OF EMPTY CONTAINERS

The movement of vehicles and goods in a transportation system can be represented as flows through a time-dependent transshipment network. An inductive out-of-skilter type of algorithm is presented which utilizes the basic underlying properties of the dynamic transshipment network to optimize the flow of a homogeneous commodity through the network, given a linear cost function. The algorithm is illustrated by its application to the problem of distributing empty containers from locations at which they are available to locations at which they are required.

• Corporate Authors:

  Elsevier Publishing Company, Incorporated

  52 Vanderbilt Avenue
  New York, NY  United States  10017
• Authors:
  • White, W W
• Publication Date: 1972

Media Info

• Features: References;
• Pagination: p. 211-236
• Serial:
  • NETWORKS
  • Volume: 2
  • Issue Number: 3

Subject/Index Terms

• TRT Terms: Containers; Equipment; Networks
• Old TRIS Terms: Equipment utilization
• Subject Areas: Freight Transportation; Railroads;

Filing Info

• Accession Number: 00050022
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Dec 13 1976 12:00AM