No abstract

No abstract

F or each point of a road network, let there be given the number of cars starting from it, and the destination of the cars. Under these conditions one wishes to estimate the distribution of traffic flow. Whether one street is preferable to another depends not only on the quality of the road, but also on the density of the flow. If every driver takes the path that looks most favorable to him, the resultant running times need not be minimal. Furthermore, it is indicated by an example that an extension of the road network may cause a redistribution of the traffic that results in longer individual running times.

No abstract

No abstract

No abstract

This paper proposes, for a fixed demand traffic network problem, a route travel choice adjustment process formulated as a projected dynamical system, whose stationary points correspond to the traffic equilibria. Stability analysis is then conducted in order to investigate conditions under which the route travel choice adjustment process approaches equilibria. We also propose a discrete time algorithm, the Euler method, for the computation of the traffic equilibrium and provide convergence results. The notable feature of the algorithm is that it decomposes the traffic problem into network subproblems of special structure, each of which can then be solved simultaneously and in closed form using exact equilibration. Finally, we illustrate the computational performance of the Euler method through various numerical examples.

No abstract