A Traffic Assignment Model Based on Link Densities

A new model is presented that determines the traffic equilibrium on congested networks using link densities as well as costs in a manner consistent with the fundamental traffic equation. The solution so derived satisfies Wardrop’s first principle. This density-based approach recognizes traffic flow reductions that may occur when network traffic congestion is high; also, it estimates queue lengths (i.e., the number of vehicles on saturated links), and it explicitly takes into account the maximum flow a link can handle, which is defined by the fundamental traffic equation. The model is validated using traffic microsimulations and implemented on a typical Nguyen-Dupuis network to compare it with a flow-based approach. System optimal assignment model based on link densities is also presented.

  • Record URL:
  • Availability:
  • Supplemental Notes:
    • © 2019 Louis de Grange et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • Authors:
    • de Grange, Louis
    • Marechal, Matthieu
    • Gonzalez, Felipe
  • Publication Date: 2019

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01717124
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Sep 18 2019 9:17AM