Computer Code for Transportation Network Design and Analysis

Details

• Creators:
  Harvey, R. P. ; Robinson, D. W.
• Corporate Creators:
  John A. Volpe National Transportation Systems Center, (U.S.)
• Corporate Contributors:
  United States. Dept. of Transportation. Office of the Secretary
• Subject/TRT Terms:
  • Algorithms
  • Computer programming
  • Computer programs
  • Cost allocation
  • Decomposition
  • Linear programming
  • Mathematical models
  • Network analysis (Planning)
• Publication/ Report Number:
  DOT-TSC-OST-77-39
• Resource Type:
  Tech Report
• Geographical Coverage:
  United States
• Corporate Publisher:
  United States. Dept. of Transportation. Office of the Secretary
• NTL Classification:
  NTL-PLANNING AND POLICY-PLANNING AND POLICY
• Abstract:
  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.
• Format:
  PDF
• Download URL:
  https://rosap.ntl.bts.gov/view/dot/11858/dot_11858_DS1.pdf
• File Type:
  [PDF - 3.67 MB]
• Collection(s):
  Volpe Center
• Main Document Checksum:
  urn:sha256:4c15ee810f110ed0c7c4032e9126bc0ef1f00ebf0edb6698431215802d570413