ON THE COMBINED DISTRIBUTION AND ASSIGNMENT PROBLEM

This paper investigates the combined traffic distribution and assignment problem and the way in which different methods based on decomposition/partitioning techniques can be derived for its solution. The different decomposition techniques lead to different types of sub/master problems. By using the formulation of the distribution problem used by Erlander and then using benders partitioning to solve the combined problem the ordinary assignment problem is obtained as a subproblem which makes it possible to use specially derived methods for this problem i.e. Multicommodity flow algorithms and as master problem a modified distribution problem. Contrary to the two types of problem occurring when Dantzig-Wolfe decomposition is applied the structure and the sparseness of the lp problem (assignment problem) is saved and instead the distribution part of the problem becomes complicated. Computer tests will be made to compare the two alternative solution methods. /TRRL/

  • Corporate Authors:

    Linkoeping University, Sweden

    Department of Mathematics
    S-58183 Linkoeping,   Sweden 
  • Authors:
    • Joernsten, K
  • Publication Date: 1978

Media Info

  • Features: References;
  • Pagination: 23 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00183456
  • Record Type: Publication
  • Source Agency: Transport and Road Research Laboratory (TRRL)
  • Report/Paper Numbers: LITH-MAT-R-77-67 Monograph
  • Files: ITRD, TRIS
  • Created Date: Dec 29 1978 12:00AM