AGGREGATION IN NETWORK MODELS FOR TRANSPORTATION PLANNING

This report documents research performed on techniques of aggregation applied to network models used in transportation planning. The central objective of this research has been to identify, extend, and evaluate methods of aggregation so as to improve the capabilities of the transportation planner by better computational methods, by more flexible models, and by increased confidence in the results obtained from aggregated models. The results of the research are presented in a series of papers. Papers 1 and 2 address the question of error bounding in the lifted (disaggregated) solution using the application of duality theory. Paper 3 reviews the potential performance of a new algorithm for the equilibrium model using path extraction aggregation. Paper 4 addresses potential savings of aggregation. Paper 5 presents results on aggregation test networks and attempts to formulate rules for equilibrium models. Papers 6 and 7 present specific mathematical results on two aggregation-related problems.

  • Corporate Authors:

    Mathematica, Incorporated

    P.O. Box 2392
    Princeton, NJ  United States  08540

    Transportation Systems Center

    55 Broadway, Kendall Square
    Cambridge, MA  United States  02142
  • Authors:
    • CULLEN, D
    • KUHN, H
    • FRANK, M
  • Publication Date: 1978-2

Media Info

  • Pagination: 136 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00198206
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Report/Paper Numbers: DOT-TSC-RSPD-78-7 Final Rpt.
  • Contract Numbers: DOT-TSC-883
  • Files: NTIS, TRIS
  • Created Date: Sep 15 1979 12:00AM