AN EQUILIBRIUM ALGORITHM FOR THE SPATIAL AGGREGATION PROBLEM OF TRAFFIC ASSIGNMENT

Present traffic assignment methods require that all possible origins and destinations of trips within a study area be represented as if they were taking place to and from a small set of points or centroids, each of which represents the location of all trip ends within a given zone. Since this necessarily misrepresents points located at the zone edges, smaller zones and more centroids could be used, but existing traffic assignment algorithms cannot efficiently handle many centroids. An algorithmic procedure has been developed to provide more than one centroid per zone. These multiple centroids or "subcentroids" are connected to the network at selected "access nodes" (either in or out of the zone), but the permissible number of centroids is still limited.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/01912615
• Supplemental Notes:
  • See also HS-030 090.
• Corporate Authors:

  Pergamon Press, Incorporated

  Headington Hill Hall
  Oxford OX30BW,    
• Authors:
  • Daganzo, C F
• Publication Date: 1980-9

Media Info

• Features: References;
• Pagination: p. 221-228
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 14B
  • Issue Number: 3
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Algorithms; Origin and destination; Traffic assignment; Traffic distribution
• Old TRIS Terms: Centroids
• Subject Areas: Safety and Human Factors;

Filing Info

• Accession Number: 00376854
• Record Type: Publication
• Source Agency: National Highway Traffic Safety Administration
• Report/Paper Numbers: HS-030 089
• Contract Numbers: NSF-ENG-77-05701, NSF-ENG-78-12004
• Files: HSL, USDOT
• Created Date: Jul 30 1983 12:00AM