Accession Number : ADA184894
Title : Solving the Multicommodity Transshipment Problem.
Descriptive Note : Doctoral thesis,
Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Personal Author(s) : Staniec, Cyrus J
PDF Url : ADA184894
Report Date : Jun 1987
Pagination or Media Count : 126
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.
Descriptors : *SHIPPING, *ALGORITHMS, PROBLEM SOLVING, COMMODITIES, COMPUTATIONS, OPTIMIZATION, PROBLEM SOLVING, THESES
Subject Categories : Surface Transportation and Equipment
Distribution Statement : APPROVED FOR PUBLIC RELEASE