Modelling dynamic network loading ontransportation networks through a continuous

The efforts spent by researchers in the last few years in traffic modelling have been focused on the modelization of dynamic behaviour of the several components making up a transportation system.In the field of traffic assignment, a large number of models and procedures have been proposed in order to perform Dynamic Network Loading (DNL), that is the reproduction of within-day variable link performances once a corresponding Origin/Destination (O/D) demand and users' choice model has been given. These models can be used both to evaluate traffic flows and, what is more relevant, to simulate the effects of regulation strategies on users' behaviour. In this paper, after a brief review of the state of the art in this field, a continuous dynamic network loading model is proposed; it removes some of the drawbacks of other packet approach models proposed in literature and explicitly allows the en-route modification of the followed path. An algorithmic development of the model and a set of applications on text net...

[1]  Hani S. Mahmassani,et al.  Effect of real-time information on network performance under alternative dynamic assignment rules , 1993 .

[2]  Markos Papageorgiou,et al.  Dynamic modeling, assignment, and route guidance in traffic networks , 1990 .

[3]  Sam Yagar CORQ-a model for predicting flows and queues in a road corridor , 1975 .

[4]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[5]  Markos Papageorgiou,et al.  Modelling and real-time control of traffic flow on the southern part of Boulevard Peripherique in Paris: Part I: Modelling , 1990 .

[6]  Malachy Carey,et al.  Nonconvexity of the dynamic traffic assignment problem , 1992 .

[7]  Omar Drissi-Kaïtouni,et al.  A Dynamic Traffic Assignment Model and a Solution Algorithm , 1992, Transp. Sci..

[8]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[9]  Malachy Carey,et al.  Optimal Time-Varying Flows on Congested Networks , 1987, Oper. Res..

[10]  M J Smith,et al.  PARALLEL DYNAMIC TRAFFIC EQUILIBRIUM ASSIGNMENT , 1993 .

[11]  M J Lighthill,et al.  On kinematic waves II. A theory of traffic flow on long crowded roads , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[12]  B Wie,et al.  DYNAMIC SYSTEM OPTIMAL TRAFFIC ASSIGNMENT ON CONGESTED MULTIDESTINATION NETWORKS , 1990 .

[13]  Bruce N Janson,et al.  NETWORK DESIGN EFFECTS OF DYNAMIC TRAFFIC ASSIGNMENT , 1995 .

[14]  Petros C. Vythoulkas,et al.  A DYNAMIC STOCHASTIC ASSIGNMENT MODEL FOR THE ANALYSIS OF GENERAL NETWORKS , 1990 .

[15]  P C Baguley,et al.  CONTRAM: A TRAFFIC ASSIGNMENT MODEL FOR PREDICTING FLOWS AND QUEUES DURING PEAK PERIODS , 1978 .

[16]  Harold J Payne,et al.  FREFLO: A MACROSCOPIC SIMULATION MODEL OF FREEWAY TRAFFIC , 1979 .

[17]  Harold J Payne,et al.  MODELS OF FREEWAY TRAFFIC AND CONTROL. , 1971 .

[18]  E. Cascetta,et al.  A DAY-TO-DAY AND WITHIN-DAY DYNAMIC STOCHASTIC ASSIGNMENT MODEL , 1991 .