A VARIATIONAL INEQUALITY FORMULATION OF THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEM

this paper is concerned with the modelling of the Dynamic Traffic Assignment Problem (DTAP) for analysing the day time varying flows of urban transportation networks. During the past two decades, many models have been proposed in the literature, but some of them are based on heuristic concepts, and most of them incorporate important limitations. In this paper, the author proposes a Dynamic Traffic Assignment Model which is mainly based on the following assumption: the time spent by a vehicle on a link may be decomposed into a fixed travel time and a waiting time. The fixed travel time is the free flow travel time, after which vehicles are put in the link exit queue, until that there is room for them to proceed their trip. They show that this model leads to a network structure (a temporal expansion of the base network, including the queues), then, they formulate the DTAP as a network equilibrium problem over the expanded network. The mathematical formulation is achieved through a variational inequality where the variables are the path (or link) flows over the space-time expanded network. Numerical results show that the model may handle large networks, so it may be used in practice to analyse the traffic congestion moves in real cities, as well in the space (physical links) as in the day time). (A)

  • Corporate Authors:

    CENTRE DE RECHERCHE SUR LES TRANSPORTS. UNIVERSITE DE MONTREAL

    C.P. 6128, SUCCURSALE A
    MONTREAL, QUEBEC  Canada  H3C 3J7
  • Authors:
    • DRISSI-KAITOUNI, O
  • Publication Date: 1990

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00674411
  • Record Type: Publication
  • Source Agency: Transportation Association of Canada (TAC)
  • Files: ITRD
  • Created Date: Mar 8 1995 12:00AM