Solving the Multicommodity Transshipment Problem.

Abstract

We examine two categories of solution algorithms for the large-scale multicommodity transshipment problem (MCTP): resource direction and price direction. In the former category we construct RDLB, a new algorithm which uses a simplified projection method in the subgradient capacity reallocations and conjugate subgradient directions with approximate line search to provide better termination conditions in the Lagrangean lower-bounding iteration. In the latter category, we develop DDC, a dual decomposition, and we introduce RSD(P) and RSD(A), new non-linear decomposition algorithms for the MCTP based on penalty transformations of the original problem and using restricted simplicial decomposition.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1987
Accession Number
ADA184894

Entities

People

  • Cyrus J. Staniec

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Computations
  • Computer Programming
  • Computers
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Nonlinear Programming
  • Numerical Analysis
  • Operations Research
  • Optimization
  • Simplex Method
  • Standards
  • Theses
  • United States

Readers

  • Operations Research