pith. sign in

arxiv: 1010.5747 · v6 · pith:2NID3BHInew · submitted 2010-10-27 · ⚛️ physics.soc-ph

Traffic Network Optimum Principle - Minimum Probability of Congestion Occurrence

classification ⚛️ physics.soc-ph
keywords networktrafficprinciplebreakdownflowoptimumbottlenecksminimum
0
0 comments X
read the original abstract

We introduce an optimum principle for a vehicular traffic network with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached, when link flow rates are assigned in the network in such a way that the probability for spontaneous occurrence of traffic breakdown at one of the network bottlenecks during a given observation time reaches the minimum possible value. Based on numerical simulations with a stochastic three-phase traffic flow model, we show that in comparison to the well-known Wardrop's principles the application of the BM principle permits considerably greater network inflow rates at which no traffic breakdown occurs and, therefore, free flow remains in the whole network.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.