This document describes the results of research into the application of the mathematical programming technique of decomposition to practical transportation network problems. A computer code called Catnap (for Control Analysis Transportation Network Analysis Program) has been developed in the course of this study; this code has the capability to solve the following problems: (1) The traffic assignment problem with fixed demands; (2) The transportation network design problem with or without a budget constraint; (3) The optimal staging problem for transportation network investments over a fixed time horizon. In this report the authors describe the basic structure and algorithms employed in Catnap and give actual numerical results obtained in some representative sample problems. These results indicated that Catnap is an improvement over existing transportation network codes, particularly for solving the network design problem.

  • Supplemental Notes:
    • See also report dated Oct 76, PB-261 340.
  • Corporate Authors:

    Control Analysis Corporation

    800 Welch Road
    Palo Alto, CA  United States  94304

    Transportation Systems Center

    55 Broadway, Kendall Square
    Cambridge, MA  United States  02142
  • Authors:
    • Harvey, R P
    • Robinson, D W
  • Publication Date: 1977-5

Media Info

  • Pagination: 126 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00167032
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Report/Paper Numbers: DOT-TSC-OST-77-39 Intrm Rpt.
  • Contract Numbers: DOT-TSC-1059
  • Files: NTIS, TRIS
  • Created Date: Oct 29 1977 12:00AM