Three geographic decomposition approaches in transportation network analysis

Details

• Creators:
  Dantzig, G. B. ; Epstein, K. A. ; Harvey, R. P. ; Lansdowne, Z. F.
• Corporate Creators:
  Control Analysis Corporation
• Corporate Contributors:
  United States. Department of Transportation. Research and Special Programs Administration ; John A. Volpe National Transportation Systems Center (U.S.)
• Subject/TRT Terms:
  • Cost allocation
  • Decomposition
  • Demand
  • Mathematical models
  • Network analysis (Planning)
  • Decomposition (Mathematics)
  • Mathematical models
  • Network flows
  • Traffic assignment
  • Transportation models
• Publication/ Report Number:
  DOT-TSC-RSPA-79-20
• Resource Type:
  Tech Report
• Geographical Coverage:
  United States
• Corporate Publisher:
  United States. Dept. of Transportation. Research and Special Programs Administration
• Abstract:
  This document describes the results of research into the application of geographic decomposition techniques to practical transportation network problems. Three approaches are described for the solution of the traffic assignment problem. One approach uses georgraphic decomposition for the solution of shortest path problems. The second and third approaches use geographic decomposition to solve directly the traffic assignment problem with fixed demands. The second approach uses the Generalized Benders Method and the third uses the Dantzig-Wolfe decomposition method. ; The first two approaches have been implemented via computer codes. In this report the algorithms and the basic structure of the computer codes are described, and preliminary numerical results are given. The work is regarded primarily as providing basic tools for further research into geographic decomposition methods.
• Format:
  PDF
• Download URL:
  https://rosap.ntl.bts.gov/view/dot/10938/dot_10938_DS1.pdf
• File Type:
  [PDF - 2.26 MB]
• Collection(s):
  Volpe Center
• Main Document Checksum:
  urn:sha256:a80a2eeee563eeefb69e20ebbeb8882ef4765163bf32771b68bfc2b572deb662