Road Traffic Models Using Petri Nets and Minplus Algebra

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Traffic problems in operations research (90B20) Programming involving graphs or networks (90C35)

Abstract: We study the relation between the average traffic flow and the vehicle density on road networks that we call 2D-traffic fundamental diagram. We show that this diagram presents mainly four phases. We analyze different cases. First, the case of a junction managed with a priority rule is presented, four traffic phases are identified and described, and a good analytic approximation of the fundamental diagram is obtained by computing a generalized eigenvalue of the dynamics of the system. Then, the model is extended to the case of two junctions, and finally to a regular city. The system still presents mainly four phases. The role of a critical circuit of non-priority roads appears clearly in the two junctions case. In Section 4, we use traffic light controls to improve the traffic diagram. We present the improvements obtained by open-loop, local feedback, and global feedback strategies. A comparison based on the response times to reach the stationary regime is also given. Finally, we show the importance of the design of the junction. It appears that if the junction is enough large, the traffic is almost not slowed down by the junction.

Recommendations

Cited in

(8)

This page was built for publication: Road Traffic Models Using Petri Nets and Minplus Algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630496)